Abstract:
Let fn(x)fn(x) be a monic polynomial of degree nn with real coefficients
fn(x)def=xn+a1xn−1+a2xn−2+⋯+an.fn(x)def=xn+a1xn−1+a2xn−2+⋯+an.
The space Π≡Rn of its coefficients a1,…an is called the coefficient space of fn(x). A pair of roots ti, tj, i,j=1,…,n, i≠j, of the polynomial fn(x) is called p:q-commensurable if ti:tj=p:q.
Resonance setRp:q(fn) of the polynomial fn(x) is called the set of all points of Π at which fn(x) has at least a pair of p:q-commensurable roots, i.e.
Rp:q(fn)={P∈Π:∃i,j=1,…,n,ti:tj=p:q}.
The chainCh(k)p:q(ti)of p:q-commensurable roots of length k is called the finite part of geometric progression with common ratio p/q and scale factor ti, each member of which is a root of the polynomial fn(x). The value ti is called the generating root of the chain.
Any partition λ of degree n of fn(x) defines a certain structure of its p:q-commensurable roots and it corresponds to some algebraic variety Vil, i=1,…,pl(n) of dimension l in the coefficient space Π. The number of such varieties of dimension l is equal to pl(n) and total number of all varieties consisting the resonance set Rp:q(fn) is equal to p(n)−1.
Algorithm for parametric representation of any variety Vl from the resonance set Rp:q(fn) is based on the following
Theorem.
Let Vl, dimVl=l, be a variety on which fn(x) has l different chains roots and the chain Ch(m)p:q(t1) has length m>1. Let rl(t1,t2,…,tl) is a parametrization of variety Vl. Therefore the following formula
rl(t1,…,tl,v)=rl(t1,…,tl)+p(v−pm−1t1)t1(pm−qm)[rl(t1,…,tl)−rl((q/p)t1,…,tl)]
gives parametrization of the part of variety Vl+1, on which there exists Ch(m−1)p:q(t1), simple root v and other chains of roots are the same as on the initial variety Vl.
From the geometrical point of view the Theorem means that part of variety Vl+1 is formed as ruled surface of dimension l+1 by the secant lines, which cross its directrix Vl at two points defined by such values of parameters t11 and t21 that t11:t21=q:p. If fn(x) has on the variety Vl+1 pairs of complex-conjugate roots it is necessary to make continuation of obtained parametrization rl(t1,…,tl,v).
Resonance set of a cubic polynomial f3(x) can be used for solving the problem of formal stability of a stationary point (SP) of a Hamiltonian system with three degrees of freedom. Let Hamiltonian function H(z) expand in SP H(z)=∑∞i=2Hi(z), where z=(q,p), q and p — are coordinates and momenta, Hi(z) — are homogeneous functions of degree i. Characteristic polynomial f(λ) of the linearized system ˙z=JAz, A=HessH2,
can be considered as a monic cubic polynomial. Resonance sets Rp:q(fn) for p=1,4,9,16, q=1, give the boundaries of subdomains in Π, where Bruno's Theorem of formal stability [9] can be applied.
Keywords:
elimination theory, subresultant, computer algebra, formal stability of a stationary point, resonance set.
Document Type:
Article
UDC:512.62+004.421.6
BBC:
22.143+22.21
Language: Russian
Citation:
A. B. Batkhin, “Resonance set of a polynomial and problem of formal stability”, Vestnik Volgogradskogo gosudarstvennogo universiteta. Seriya 1. Mathematica. Physica, 2016, no. 4(35), 6–24
\Bibitem{Bat16}
\by A.~B.~Batkhin
\paper Resonance set of a polynomial and problem of formal stability
\jour Vestnik Volgogradskogo gosudarstvennogo universiteta. Seriya 1. Mathematica. Physica
\yr 2016
\issue 4(35)
\pages 6--24
\mathnet{http://mi.mathnet.ru/vvgum115}
\crossref{https://doi.org/10.15688/jvolsu1.2016.4.1}
Linking options:
https://www.mathnet.ru/eng/vvgum115
https://www.mathnet.ru/eng/vvgum/y2016/i4/p6
This publication is cited in the following 4 articles:
A. B. Batkhin, Z. Kh. Khaydarov, “Calculation of a strong resonance condition in a Hamiltonian system”, Comput. Math. Math. Phys., 63:5 (2023), 687–703
A. B. Batkhin, Z. Kh. Khaidarov, “Symbolic Computation of an Arbitrary-Order Resonance Condition in a Hamiltonian System”, Program Comput Soft, 49:8 (2023), 842
Alexander Borisovich Batkhin, Zafar Khaydar ugli Khaydarov, “Strong resonances in nonlinear Hamiltonian system”, KIAM Prepr., 2022, no. 59, 1
A. B. Batkhin, “Computation of generalized discriminant of a real polynomial”, Keldysh Institute preprints, 2017, 88–40