C:/Documents and Settings/Profesor/Escritorio/Cubo/Cubo/Cubo/Cubo 2011/Cubo2011-13-01/Vol13 n\2721/Art N\2603 .dvi CUBO A Mathematical Journal Vol.13, No¯ 01, (25–43). March 2011 Evolutionary method of construction of solutions of polynomials and related generalized dynamics Robert M. Yamaleev Facultad de Estudios Superiores, Universidad Nacional Autonoma de Mexico, Cuautitlán Izcalli, Campo 1, C.P.54740, México. Joint Institute for Nuclear Research, LIT, Dubna, Russia. email: iamaleev@servidor.unam.mx ABSTRACT Invariant theory as a study of properties of polynomials under translational transfor- mations is developed. Class of polynomials with congruent set of eigenvalues is intro- duced. Evolution equations for eigenvalues and coefficients remaining the polynomial within proper class of polynomials are formulated. The connection with equations for hyper-elliptic Weierstrass and hyper-elliptic Jacobian functions is found. Algorithm of calculation of eigenvalues of the polynomials based on the evolution process is elabo- rated. Elements of the generalized dynamics with n-order characteristic polynomials are built. RESUMEN La teoŕıa de invariantes es un estudio de las propiedades de los polinomios que se desarrolla en las transformaciones de traslación. Se introduce una clase de polinomios congruentes con un conjunto de valores propios. Se formulan ecuaciones de evolución de los valores propios y los coeficientes del polinomio restante dentro de la clase adecuada 26 Robert M. Yamaleev CUBO 13, 1 (2011) de los polinomios. Se encuentra la conexión con las ecuaciones de Weierstrass hiper- eĺıpticas y funciones jacobiano hiper-eĺıptica. Son elaborados algoritmos de cálculo de valores propios de los polinomios basado en el proceso de evolución. Keywords: Nonspreading mapping, maximal monotone operator, inverse strongly-monotone map- ping, fixed point, iteration procedure Mathematics Subject Classification: 12Yxx 1 Introduction The problem of construction of solutions of the polynomial equations as a certain functions of the coefficients is one of the oldest mathematical problems. E.Galois and H.Abel had proved that the polynomial higher than fourth order, in general, does not admit a presentation of solutions by radicals [3]. This rigorous mathematical theory directed mathematicians to look for the other ways of solutions. In particularly, the eigenvalues of the polynomials can be expressed in analytical way as certain functions of the coefficients [2], [7]. Ch.Hermite was first who found an elegant expression of eigenvalues of the quintic equation by modular functions [6]. The theory of elliptic functions originally was related with the problem of finding of eigenvalues of the cubic polynomial. In fact, the eigenvalues of the cubic equation admit presentation by Weierstrass elliptic functions at the periods [12]. It is clear, however, that for a search of analytical solutions of the n > 5- degree polynomials one needs of mathematical tools beyond the elliptic functions. In this context as hopeful tools one may consider the theories of hyper-elliptic functions [9] and multi-complex algebras [8], [13]. The main purpose of the present paper is to construct an Algorithm for calculation roots of the polynomials. For that purpose, firstly, we study invariant properties of the polynomials with respect to simultaneous translations of the roots. Secondly, we build the system of evolution equations for the coefficients transforming the given polynomial into the polynomial with one trivial solution. The evolution process is directed in a such way that remain the original polynomial within proper class where the roots of the polynomials form congruent set of values. The coefficients of the polynomial with respect to the parameter of evolution are solutions of the Cauchy problem for ordinary differential equations. As soon as the Cauchy problem is resolved, the eigenvalues of initial polynomial are found simply by simultaneous translations of the set of eigenvalues of the final polynomial. Since the final polynomial possesses with one trivial solution, the degree of the polynomial is reduced from n to (n − 1) which simplifies the process of solution. If solution of the obtained polynomial still is a difficult problem, then the method can be applied again in order to reduce the degree of the obtained polynomial. This process can be continued up till linear equation. The inverse process is fulfilled simply by simultaneous translations of the roots from the solution of the linear equation up till solutions of n-degree polynomial. It is shown, the evolution equations for the coefficients can be identified with equations for Weierstrass-type CUBO 13, 1 (2011) Evolutionary method of construction of solutions of polynomials and related generalized dynamics 27 hyper-elliptic functions, whereas the evolution equations for the roots are given by equations for Jacobian-type hyper-elliptic functions. Furthermore, it is demonstrated a link between evolution equations for the coefficients of the polynomials and the classical dynamic equations. In n-order generalized mechanics the inner- and outer-momenta are inter-related as roots and coefficients of the characteristic n-degree polynomial. In particular n = 2 case, we return to well-known equations of the relativistic dynamics closely related with quadratic polynomial of the mass-shell equation. Besides the Introduction the paper contains the following sections. In Section 2, the equations of evolution for the coefficients of n-degree polynomial are formu- lated. In Section 3, the Algorithm of finding of eigenvalues of the n-degree polynomial is built. In Section 4, some peculiarities of the cubic equation is explored. In Section 5, the elements of the relativistic dynamics based on quadratic characteristic polynomial is presented. In Section 6 elements of the generalized dynamics related with n-degree characteristic polynomial is outlined. 2 Evolution equations for eigenvalues and coefficients of n- degree polynomial If F is a field and q1, ..., qn are algebraically independent over F , the polynomial p(X) = n∏ i=1 (X − qi) is referred to as generic polynomial over F of degree n. The polynomial equation of n-degree over field F is written in the form p(X) := Xn + n−1∑ k=1 (−)k(n − k + 1)PkXn−k + (−)nP 2 = 0, (2.1) where the coefficients Pk ∈ F (q1, ..., qn). In this paper we shall restrict our attention only to polynomials with real coefficients and with simple roots. The signs at the coefficients in Eq.(2.1) are changed from term to term which allows in Vièta formulae to keep only the positive signs. The expressions at the coefficients are included for a convenience and have no real bearing on the theory. The mapping from the set of eigenvalues onto the set of coefficients is given by Vièta formulae (a) nP1 = n∑ i=1 qi, (b) P 2 = n∏ i=1 qi, (c) Pk = ∑ 1≤r1<...