This paper attempts to modify the standard Verhulst model to describe the dynamics of scientific conferences taking into account cumulative advantage.

In this paper, we for the first time propose the extension of optimal eighth-order methods to multidimensional case. It is shown that these extensions maintained the optimality properties of the original methods. The computational efficiency of the proposed methods is compared with that of known methods. Numerical experiments are included to confirm the theoretical results and to demonstrate the efficiency of the methods.

New possibilities of the 16-spinor realization of the Skyrme-Faddeev chiral model are discussed. Using gauge invariance principle, it is shown that there exist two independent ways for breaking the isotopic invariance symmetry. The first one concerns the interaction with the electromagnetic field (ordinary photons generated by the electric charge) and the second one includes the interaction with the new vector field (shadow/dark photons generated by the special neutrino charge). The neutrino oscillation phenomenon is explained.

The article studies the effectiveness of implementation of multi-agent systems based on large language models in various spheres of human activity, analyses their advantages, problems and challenges. The results of the research have shown that multi-agent systems based on large language models have significant potential and wide opportunities in modelling various environments and solving various tasks.

The motivation of this paper was the development of computer geometry course for students of mathematical specialties. The term “computer geometry” hereafter refers to the mathematical foundations of machine graphics. It is important to emphasize separately that this course should be designed for second-year students and, therefore, they can only be required to have prior knowledge of a standard course in algebra and mathematical analysis. This imposes certain restrictions on the material presented. When studying the thematic literature, it was found out that the de facto standard in modern computer graphics is the use of projective space and homogeneous coordinates. However, the authors faced a methodological problem-the almost complete lack of suitable educational literature in both Russian and English. This paper was written to present the information collected by the authors on this issue.

The problem of summation of Fourier series in finite form is formulated in the weak sense, which allows one to consider this problem uniformly both for classically convergent and for divergent series. For series with polynomial Fourier coefficients \(a_n, b_n \in \mathbb{R}[n]\), it is proved that the sum of a Fourier series can be represented as a linear combination of 1, \(\delta(x)\), \(\cot \frac{x}{2}\) and their derivatives. It is shown that this representation can be found in a finite number of steps. For series with rational Fourier coefficients \(a_n, b_n \in \mathbb{R}(n)\), it is shown that the sum of such a series is always a solution of a linear differential equation with constant coefficients whose right-hand side is a linear combination of 1, \(\delta(x)\), \(\cot \frac{x}{2}\) and their derivatives. Thus, the issue of summing a Fourier series with rational coefficients is reduced to the classical problem of the theory of integration in elementary functions.

The article describes a method for calculating interpolation coefficients of expansion using Chebyshev polynomials. The method is valid when the desired function is bounded and has a finite number of maxima and minima in a finite domain of interpolation. The essence of the method is that the interpolated desired function can be represented as an expansion in Chebyshev polynomials; then the expansion coefficients are determined using the collocation method by reducing the problem to solving a well-conditioned system of linear algebraic equations for the required coefficients. Using the well-known useful properties of Chebyshev polynomials can significantly simplify the solution of the problem of function interpolation. A technique using the Clenshaw algorithm for summing the series and determining the expansion coefficients of the interpolated function, based on the discrete orthogonality of Chebyshev polynomials of the 1st kind, is outlined.

There are two main approaches to the numerical solution of the eikonal equation: reducing it to asystemofODES(methodofcharacteristics)andconstructingspecializedmethodsforthenumericalsolutionof this equation in the form of a partial differential equation. The latter approach includes the FSM (Fast sweeping method) method. It is reasonable to assume that a specialized method should have greater versatility. The purpose of this work is to evaluate the applicability of the FSM method for constructing beams and fronts. The implementation of the FSM method in the Eikonal library of the Julia programming language was used. The method was used for numerical simulation of spherical lenses by Maxwell, Luneburg and Eaton. These lenses were chosen because their optical properties have been well studied. A special case of flat lenses was chosen as the easiest to visualize and interpret the results. The results of the calculations are presented in the form of images of fronts and rays for each of the lenses. From the analysis of the obtained images, it is concluded that the FSM method is well suited for constructing electromagnetic wave fronts. An attempt to visualize ray trajectories based on the results of his work encounters a number of difficulties and in some cases gives an incorrect visual picture.

Usually, when working with the eikonal equation, reference is made to its derivation in the monograph by Born and Wolf. The derivation of this equation was done rather carelessly. Understanding this derivation requires a certain number of implicit assumptions. For a better understanding of the eikonal approximation and for methodological purposes, the authors decided to repeat the derivation of the eikonal equation, explicating all possible assumptions. Methodically, the following algorithm for deriving the eikonal equation is proposed. The wave equation is derived from Maxwell’s equation. In this case, all conditions are explicitly introduced under which it is possible to do this. Further, from the wave equation, the transition to the Helmholtz equation is carried out. From the Helmholtz equation, with the application of certain assumptions, a transition is made to the eikonal equation. After analyzing all the assumptions and steps, the transition from the Maxwell’s equations to the eikonal equation is actually implemented. When deriving the eikonal equation, several formalisms are used. The standard formalism of vector analysis is used as the first formalism. Maxwell’s equations and the eikonal equation are written as three-dimensional vectors. After that, both the Maxwell’s equations and the eikonal equation use the covariant 4-dimensional formalism. The result of the work is a methodically consistent description of the eikonal equation.