Lax Pairs for Linear Hamiltonian Systems
D.V. Osipov, A.B. Zheglov

TL;DR
This paper constructs Lax pairs for linear Hamiltonian systems using Gr"obner bases, proving their Poisson nature and exploring properties of associated first integrals, advancing the understanding of integrability in such systems.
Contribution
It introduces a method to construct Lax pairs for linear Hamiltonian systems and proves their Poisson property, providing new tools for analyzing integrability.
Findings
Lax pairs are explicitly constructed for linear Hamiltonian systems.
The maps in the Lax pairs are shown to be Poisson.
Properties of first integrals derived from Lax pairs are investigated.
Abstract
In the paper Lax pairs for linear Hamiltonian systems of differential equations are constructed. In particular, Gr\"obner bases are used for the computations. It is proved that the maps which appear in the construction of Lax pairs are Poisson. Various properties of first integrals of the system which are obtained from the Lax pairs are investigated.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Lax Pairs for Linear Hamiltonian Systems††thanks: The work of the first author is partially supported by Laboratory of Mirror Symmetry NRU HSE, RF Government grant, ag. №14.641.31.0001. The work of the second author was supported by RFBR grants 16-01-00378-a and 16-51-55012 China-a.
D. V. Osipov, A. B. Zheglov
Abstract
In the paper, Lax pairs for linear Hamiltonian systems of differential equations are constructed. In particular, Gröbner bases are used for the computations. It is proved that the maps which appear in the construction of Lax pairs are Poisson. Various properties of first integrals of the system which are obtained from the Lax pairs are investigated.
1 Introduction
The aim of this paper is to calculate Lax pairs for a linear system of differential equations
[TABLE]
where the column vector , matrices , . Here the matrix is assumed to be symmetric, and the matrix is assumed to be skew-symmetric, that is,
[TABLE]
We will also assume that (what explains the parity of the dimension of the vector space) and .
On the other hand, if we consider an arbitrary system of differential equations
[TABLE]
admitting a quadratic first integral , where the column vector , matrices , , and , , then is a non-degenerate skew-symmetric matrix (see works [1, 2]), and system (2) is immediately reduced to the form (1), therefore .
We note that system (1) is Hamiltonian, see section 2 below.
By a Lax pair of dimension for system (1) we mean a smooth map
[TABLE]
which translates the solutions of system (1) into the solutions of the following matrix differential equation:
[TABLE]
where . In other words, if is a vector field on generated by system (1), then for any we have that the -component of the tangent vector at the point is defined by the system (4).
From here, as it is known, it follows that for the function
[TABLE]
holds , that is, the function is constant on the solutions of the system (4). Therefore, the preimage of any functional combination of the real and imaginary parts of the function with respect to the map is the first integral of the system (1). The main problem in this approach is to verify the nontriviality of the integrals, as well as the question of the completeness of the system of first integrals obtained using different Lax pairs.
We note that the study of Lax pairs for linear Hamiltonian systems is the first step to the non-linear case, since any non-linear system of differential equations gives a linear system in the first approximation. For example, if the system is Hamiltonian, then one can decompose the Hamiltonian of the system into a Taylor series and leave for further consideration only terms with order of degree at most two.
For , we investigate all possible Lax pair of dimension for the system (1) in section 3. For the final answer in this case, we also use computer calculations using the Gröbner bases. The use of Gröbner bases for finding Lax pairs, as far as we know, has never been used before this work. They were also used to get Lax pairs in the general case (see below). For a brief overview of the technology associated with the Gröbner bases, see, for example, in the brochure [3] or in the book [4].
For an arbitrary , as well as for a pair: an eigenvalue and an eigenvector for this eigenvalue of the matrix , we build a Lax pair of dimension in section 4. We show that for different eigenvalues the first integrals of the system (1), constructed from the function , are in involution on the space with respect to the Poisson bracket given by the skew-symmetric matrix . These first integrals are quadratic functions on the space , and in the case of a simple spectrum of the matrix forms a complete set of functionally independent first integrals of Hamiltonian system (1) (for complex eigenvalues and eigenvectors, we must take the real and imaginary parts of the corresponding functions, as we noted above). Thus, we obtain a new simple proof of the result of J. Williamson, see [5], that the system (1) admits first quadratic integrals that are pairwise in involution and functionally independent, see Remark 4.3. (A detailed discussion of this theme, with additional links, is provided at the end of [2, § 2].)
In Section 5, we show that the map arising in the construction of Lax pairs is a morphism of Poisson manifolds with respect to the natural Poisson brackets.
We are grateful to A. N. Parshin for posing the problem and numerous discussions. The starting point of our research was the report by V. V. Kozlov "The Symplectic Geometry of Linear Hamiltonian Systems and the Solution of Algebraic Equations" at the joint seminar of the departments of Algebra and Algebraic geometry at Steklov Mathematical Institute in September 2017.
2 Preliminaries
Recall the following well-known facts about symplectic structures and Poisson brackets.
Let a non-degenerate skew-symmetric matrix , where is an even number, defines a symplectic structure on the space with the help of -form
[TABLE]
The vector field on is called Hamiltonian with Hamiltonian , which is a smooth function on , if
[TABLE]
where is an arbitrary vector field on . We will denote such a vector field as . For two smooth functions and on the space their Poisson bracket is determined by the following equations:
[TABLE]
Then, in coordinates,
[TABLE]
where the column of functions, the gradient, is , and are standard coordinates in .
Returning to the system (1) (in this case ), one can see by simple calculations that if the matrix , then the vector field is Hamiltonian with Hamiltonian , , see also [2, § 1]. Therefore, the system (1) is Hamiltonian with respect to the symplectic structure described above on , specified by the skew-symmetric matrix .
Further we will use the following statements. We assume that the matrices and satisfy the conditions, as at the beginning of the Introduction.
Proposition 2.1. The following is true.
If is an eigenvalue of the matrix , then , , are also eigenvalues of the matrix . 2. 2.
Let and be (complex) eigenvalues of the matrix with corresponding eigenvalues and from . If , then
[TABLE] 3. 3.
Let the spectrum of the matrix be simple. If is an eigenvector of the matrix , which is not an eigenvector of the matrix , then
[TABLE]
Proof.
- This property follows from the fact that the matrix is real, and from the equalities
[TABLE]
where is the identity matrix.
- This property follows from the chain of equalities:
[TABLE]
- Since the spectrum of the matrix is simple, then from item 1 of this proposition it follows that the matrix is diagonalized, with a two-dimensional subspace of eigenvectors corresponding to each eigenvalue. Let be a matrix composed of columns that are linearly independent (over ) eigenvectors of the matrix , so that the columns corresponding to one eigenvalue are adjacent. Then the matrix has the number on the place, where is the -th column of . Therefore, from item 2 of this proposition, we obtain that is a block-diagonal matrix with blocks on the diagonal. Note that is also an eigenvector of the matrix with the same eigenvalue as the vector , but the vector is not proportional to the vector . Therefore, if , then one of the blocks of the matrix would be equal to zero. It would follow from this that . Therefore, , a contradiction. ∎
3 Lax Pairs for
3.1 Using the square root of the matrix
In this section, we present the Lax pair of dimension for the system (1) in the case , so that the function will be the first integral of this system coinciding with , where the Hamiltonian is . Later, in section 4 we give the general formulas for Lax pairs of dimension for system (1), but these formulas will differ from this one in the case of and the Hamiltonian (for arbitrary ) will be obtained only as a linear combination of the first integrals connected with Lax pairs.
Since , there exists a symmetric matrix , such that . (Such a matrix always exists, since by conjugation by orthogonal matrices from the matrix can always be reduced to a diagonal matrix, from which we take the root in the form of a diagonal matrix and then apply the reverse pairing.) Note that .
We will use the following identity
[TABLE]
which is immediately verified by direct calculations for explicit matrices
[TABLE]
Let be a standard coordinate column in . We introduce the matrices
[TABLE]
[TABLE]
where for the last equality we used equality (6).
Note that from the explicit form (7) for the matrix and equality (8) by easy calculations we get the following explicit form for the matrix :
[TABLE]
This shows that and . Thus, the matrix is uniquely determined by its first column.
The matrices and form a Lax pair of dimension for the system (1), as the following proposition shows.
Proposition 3.1. System (1) is equivalent to the following system
[TABLE]
Proof.
Notice, that and
[TABLE]
therefore, it is sufficient to verify formula (10) only for the first column of the resulting matrix in the left and right parts of this formula. Let’s calculate
[TABLE]
Since the multiplication of the matrix on the left by any matrix gives a matrix with a zero second column, and the multiplication of the last matrix by the matrix or on the right gives a matrix with a zero first column, then from the last equality in formula (9) we find that only the first and fourth term of the sum amount on the first column of . The sum of these terms is (taking into account again the second equality in formula (9)):
[TABLE]
where in the last equality we used the system (1). ∎
Let’s calculate now , where is a natural number. Note that for any matrix L=\left(\begin{array}[]{cc}g&h\\ h&-g\end{array}\right) we have , where is the identity matrix. Therefore, , if is odd, and . In our case, , where , and . Therefore, we obtain
[TABLE]
So, we get that , where is the Hamiltonian of system (1).
3.2 Computer calculations
We now consider the general problem of finding Lax pairs of dimension for systems of the form
[TABLE]
where is a skew-symmetric, and is an arbitrary (not necessarily symmetrical) real matrices. Without loss of generality (changing the matrix ), we assume that
[TABLE]
We will look for the matrices and such that the matrix depends linearly on the coordinates in the space (or ), and the matrix does not depend on the coordinates , and the system (11) implies the system
[TABLE]
Let the first and second columns of the matrix be respectively
[TABLE]
Let the matrix be
[TABLE]
Then the matrix equation (13) can be rewritten as a system of equations in variables , , (while the coefficients and are determined up to multiplication by a constant). This system is amenable to research using a computer. In particular, it is possible to calculate its Gröbner basis. For example, the first element of this basis, which depends only on and , has the form
[TABLE]
(The remaining elements of the Gröbner basis, computed using a computer, have a longer record.)
If we additionally assume that the matrix is symmetric, that is, , then the Gröbner basis is simplified and the system has the following general solution:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
dependent on free variables , , , , . The matrix has the form
[TABLE]
[TABLE]
The trace of the matrix is
[TABLE]
where is the Hamiltonian of system (1).
Note that the denominators in the formulas (14) - (17) have the following simple interpretation:
[TABLE]
[TABLE]
Remark 3.2. Note that the Gröbner basis is simplified not only for symmetric matrices. Consider the following example. Let the matrices and be as in the formula (12), moreover , . For such matrices, the Gröbner basis, computed using a computer, is simplified, and all Lax pairs can be found. For example, the matrix up to multiplication by a constant has the form
[TABLE]
where is a free variable. However, is always satisfied, therefore these Lax pairs do not give any non-trivial first integrals! (Confer remark 4.4 below, where .)
4 Lax pairs in general case
In this section, we construct Lax pairs of dimension for an arbitrary natural number for the system (1).
Suppose that the conditions on the matrices and are satisfied, as at the beginning of Introduction.
Let be an eigenvalue of the matrix . Define a subspace :
[TABLE]
We have that , and from item 1 of proposition 2.1 we get that is also an eigenvalue of the matrix . Therefore, , since the eigenvectors of the matrix with eigenvalues and are linearly independent over and belong to the subspace . Note that if the spectrum of the matrix is simple, then .
Note that , since and .
Choose an arbitrary non-zero column vector
[TABLE]
such that is not an eigenvector of .
We will call such a pair admissible.
Define a column vector
[TABLE]
where as usual .
Define now
[TABLE]
We introduce matrices and of size as follows:
[TABLE]
Definition 4.1. We define a quadratic function from to :
[TABLE]
*where the last equality follows from the explicit form (19) of the matrix . *
It is easy to see that (see the end of 3.1) , if is odd, and .
Each so constructed pair defines a Lax pair of dimension with interesting properties, as the following theorem shows.
Theorem 4.2. We have properties.
The pair is a Lax pair of dimension for the system (1). 2. 2.
Let and be admissible pairs, and assume . Then
[TABLE] 3. 3.
Let , where , be admissible pairs and all numbers are pairwise distinct. Then the complex -forms , where , are linearly independent over on the complement of the union of at most linear subspaces of codimension in .
Remark 4.3. Note that if is an admissible pair, then the complex conjugate pair is also an admissible pair. Besides, . Therefore, for real and imaginary parts we have
[TABLE]
Therefore, from section 2 (in particular, from formulas (5)) and items 2 and 3 of theorem 4.2, taking, if necessary, the real and imaginary parts of the quadratic functions , we immediately obtain quadratic, functionally independent first integrals for the system (1), which are pairwise in involution with respect to the Poisson bracket for the Hamiltonian system (1). In particular, if the spectrum of the matrix is simple, then we get of such first integrals. This, in particular, gives a new proof of the result from [5] (as we already noted in Introduction).
We note here the difference in approaches: to prove the functional independence of the set of first integrals in [5]111A similar approach using the iteration of various cases is also contained in [6]. a rather cumbersome theorem was used from [7] on the classification of a pair of bilinear real forms: symmetric and skew-symmetric (the formulation of this theorem is also given in [8, Appendix 6]). In our case, we construct a set of first quadratic integrals in an involution and give a very simple proof (see below), without the classification theorem for a pair of forms, that they are functionally independent. It follows from the general theory of Lie algebras that all families of first quadratic integrals in an involution generate the same vector space, and, consequently, the first integrals from [5] are also functionally independent. We will explain the latter in more detail.
Let and be two real symmetric matrices defining quadratic functions on the space . The Poisson bracket constructed from the symplectic form on defined by the skew-symmetric matrix , being applied to two quadratic functions will again be a quadratic function. This bracket will be rewritten on the set of symmetric matrices as follows:
[TABLE]
Note that the map defines an isomorphism between the Lie algebra of symmetric matrices with respect to the bracket described above, and the matrix Lie subalgebra consisting of matrices satisfying the condition . The last algebra is isomorphic to the symplectic Lie algebra through the map , where is a standard symplectic unity.
If is a symmetric matrix defining a quadratic Hamiltonian and has a simple spectrum, then the matrix also has a simple spectrum, and therefore defines a regular element in the simple Lie algebra . Then the Cartan subalgebra containing this element consists of all elements commuting with it and is an Abelian subalgebra of dimension . Therefore, there exists a unique real linear space of dimension consisting of quadratic functions that are in involution with respect to the Poisson bracket and containing the Hamiltonian.
Explicit formulas connecting our first integrals and the first integrals from [2, 5] are given in [9].
Proof.
We prove Theorem 4.2.
- We note that
[TABLE]
Therefore, the matrices , and will be again symmetric matrices with zero trace. Consequently we have
[TABLE]
Hence we obtain that system (4) is equivalent to the following system of equations:
[TABLE]
From system (1) we obtain that
[TABLE]
Hence we have
[TABLE]
Therefore we obtain
[TABLE]
The first equation from the last system is always satisfied. In order for the second equation to be satisfied, it suffices to prove that
[TABLE]
But we chose the vector with such a condition.
- From Definition 4.1 we obtain
[TABLE]
[TABLE]
where is the unit matrix. We note that from this formula we immediately obtain that , since is not an eigenvector of the matrix . Now we calculate :
[TABLE]
where is the unit matrix, and linear functions and on are the following:
[TABLE]
Now, since for any the matrix commutes with the matrix , we obtain that for any the vector is an eigenvector of the matrix with eigenvalue . Now item 2 of Theorem 4.2 follows from item 2 of Proposition 2.1.
- Since the non-zero eigenvectors corresponding to different eigenvalues are linearly independent, the statement of item 3 of this theorem follows from the explicit calculation of the gradient performed during the proof of the previous item. Besides, since the vector is not an eigenvector of the matrix , the gradient will be equal to zero only on the intersection of two linear complex hyperplanes in : and . ∎
Remark 4.4. We note if we, when constructing a Lax pair, would take an eigenvector of the matrix such that this eigenvector would be an eigenvector for the matrix , then we would obtain that (this follows at once from formula (21)). Hence we obtain the importance of the property . It is the absence of such a property that prevents us to construct a Lax pair with non-zero function for arbitrary linear system
[TABLE]
Remark 4.5. If the spectrum of matrix is simple, we can construct a Lax pair of dimension such that system (4) will be equivalent to the system (1). To do this it is enough to take block diagonal matrices and with blocks that are matrices of size , as in formula (19), with eigenvalues such that when .
Indeed, as we see from the proof of item 1 of Theorem 4.2, system (4) is equivalent to systems (20) with different pairs . But then the equations of these systems can be rewritten as systems
[TABLE]
for different eigenvectors . Since all such vectors are linearly independent, we obtain system (1):
[TABLE]
Remark 4.6. We can construct Lax pairs of dimension in other ways. Let, for example, the matrices and be from blocks which are matrices of size . We fix an eigenvalue of the matrix . We consider the following and :
[TABLE]
where is the unit matrix of size , and and are symmetric matrices of size . Let , . Then it is enough to specify the matrix elements and when . For every such pair we define and in the same way as we defined and (see formula (18)) when we constructed the Lax pair. Moreover, the eigenvalue must be the same, and the eigenvectors can change. For such a Lax pair the function is the sum of the functions , which we studied above.
Moreover, we can write the Lax pair of dimension with real coefficients and such that several eigenvalues of the matrix are taken into account. We consider the matrix of the form B=-\frac{1}{2}\left(\begin{array}[]{cc}0&J\\ -J&0\\ \end{array}\right)\,\mbox{,} where is a diagonal matrix with entries on the diagonal, and for any the number is the eigenvalue of the matrix such that if , then for some . Now we take the matrix as above, but with diagonal matrices and such that the -th numbers on diagonals of matrices and are constructed as numbers and in formula (18) for the eigenvalue . Then the pair , gives a Lax pair of dimension for system (1), and the function is the sum of the functions introduced above. By conjugating matrices and by means of permutation matrices (that is, by rearranging the vectors in the basis by some permutation), we obtain a block diagonal matrix with blocks -\frac{1}{2}\left(\begin{array}[]{cc}0&i\lambda\\ -i\lambda&0\\ \end{array}\right) of size . If , then either the block itself, or its Jordan normal form will be real matrices. If , then two such blocks with complex conjugate numbers have all different eigenvalues, and these eigenvalues are the same as the eigenvalues of the real matrix of size which can be written as a block matrix:
[TABLE]
Therefore we can make a suitable replacement of the basis, and the matrix will be real. Then the resulting Lax pair can be divided into two real ones: with the real and imaginary parts of the matrix . Since the trace does not change under the conjugation of a matrix, we obtain the same integrals as for the original Lax pair (the real and imaginary part of the trace of ).
Example 4.7. In the case , we can always ‘‘normalize’’ (that is, multiple by a complex number) the vector from an admissible pair in such a way that , where is the Hamiltonian of system (1). Namely, the vector must satisfy a condition:
[TABLE]
where the coefficients in the matrix are denoted as in the right part of formula (12) with the additional condition . (Since the vector is not proportional to the vector , the left side in formula (22) is not equal to zero.) In this case, by simple direct calculations we obtain:
[TABLE]
We note also that the condition in formula (22) can be rewritten as by means of identity (6) (where must be replaced by ).
Besides, in the notation of section 3.2, the corresponding Lax pair from Theorem 4.2 is obtained if we take , , .
Example 4.8. In the case we consider, for example, the following matrices:
[TABLE]
We define, as in the first part of Remark 4.6,
[TABLE]
where , , and two eigenvectors with the eigenvalue for the matrix are chosen: the firs one is , the second one is . We have , . Then the matrices form a Lax pair for system (1). We define
[TABLE]
Then it is not difficult to calculate that
[TABLE]
Hence we obtain that
[TABLE]
5 The maps which appear from constructions of Lax pairs are Poisson
In this section, we show that on the image of the map arising in Lax pairs from section 4 there is a symplectic structure such that the matrix equation of the Lax pair is Hamiltonian, and the map itself which appear from the construction of the Lax pair is Poisson, that is, it preserves the Poisson brackets, where on there is the Poisson bracket induced by the Hamiltonian system (1), see section 2.
By an admissible pair such that if , and by the Lax pair from Theorem 4.2 we define a map
[TABLE]
Depending on three cases : 1) ; 2) ; and 3) , , this map defines maps of real spaces for which we keep the same notation:
[TABLE]
[TABLE]
[TABLE]
where , , and .
Theorem 5.1 *Let the spectrum of matrix is simple. We choose any admissible pair such that if . Then on the image of the map there is a natural symplectic structure such that the system obtained from the Lax pair is Hamiltonian with respect to this structure, and the map is Poisson. *
Proof.
We define
[TABLE]
From the conditions of the theorem and item 3 of Proposition 2.1 it follows that .
In case 1) let and be the real coordinates on vectors and correspondingly. To define the Poisson bracket on smooth functions on the space , so that the map would be a morphism of Poisson manifolds, we define
[TABLE]
[TABLE]
where for functions on the Poisson bracket is given by the skew-symmetric matrix , as for the Hamiltonian system (1). Now the non-degenerate skew-symmetric matrix
[TABLE]
defines the symplectic structure on the space such that the corresponding Poisson brackets (see section 2) will be calculated by formulas (24)-(25) which imply that for smooth functions and on we have:
[TABLE]
And we obtain
[TABLE]
We recall that the matrix equation defined by Lax pair (4) is equivalent to system (20), that is, to the system
[TABLE]
which is, as it is easy to see, is equivalent to the system
[TABLE]
where is the scalar matrix with real numbers on the diagonal. From section 2 we obtain at once that this system is Hamiltonian with respect to the symplectic form given by the skew-symmetric matrix .
In case 2) let and be the real coordinates on the vectors and correspondingly. We define
[TABLE]
[TABLE]
Now a non-degenerate skew-symmetric matrix
[TABLE]
gives the symplectic structure on the space , so that for any two smooth functions and on the space we have
[TABLE]
Now the matrix equation defined by the Lax pair is equivalent to system (20), and in our case this system can be rewritten as
[TABLE]
that is equivalent to the system
[TABLE]
where the matrix is a diagonal matrix with real numbers , along the diagonal. The last system is Hamiltonian with respect to the symplectic form given by the skew-symmetric matrix .
In case 3) let be the real coordinate on the vector , where . Then we have
[TABLE]
We define the Poisson brackets:
[TABLE]
where we used that by item 2 of Proposition 2.1, because is an eigenvector with the eigenvalue of the matrix , and .
By similar calculations we obtain that , since and are eigenvectors of the matrix with eigenvalues and correspondingly. We calculate now
[TABLE]
where we used that by item 2 of Proposition 2.1. Similarly, we calculate
[TABLE]
[TABLE]
[TABLE]
Thus, the matrix of the pairwise Poisson brackets between the coordinate functions is the following real skew-symmetric matrix, which we write as a block matrix with blocks of size :
[TABLE]
where is a real symmetric matrix of size with zero trace. And we have
[TABLE]
We note that is again a symmetric with zero trace matrix. Now, from the calculations performed, it follows that the skew-symmetric non-degenerate matrix
[TABLE]
defines the symplectic structure on the space , so that the map will be Poisson with respect to this symplectic structure and the symplectic structure for the system (1) (see section 2), that is, the inverse image map preserves the Poisson bracket on functions.
Let , where and are real numbers. Then the matrix equation given by Lax pair (4) is equivalent to system (20), that is, to the system
[TABLE]
The last system is equivalent to the following system:
[TABLE]
where the block matrix of size is:
[TABLE]
Since the product of a symmetric matrix of size with zero trace on matrix is again a symmetric matrix with zero trace, the matrix is a symmetric block diagonal matrix of the form
[TABLE]
where is a real symmetric matrix of size with zero trace, and . Therefore system (26) is equivalent to system
[TABLE]
which, according to section 2, is Hamiltonian with the symplectic structure defined by the skew-symmetric matrix . ∎
From theorem 5.1 and item 2 of Proposition 2.1 we obtain a corollary.
**Corollary 5.2. ** *Under conditions of Theorem 5.1, we consider several admissible pairs , where , such that and for any natural numbers . We define on the image of the map the block diagonal symplectic structure, where each block corresponds to the symplectic structure for the pair from Theorem 5.1. Then the map is Poisson. *
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Arnold V. I., Mathematical methods of classical mechanics . Translated from the Russian by K. Vogtmann and A. Weinstein. Second edition. Graduate Texts in Mathematics, 60. Springer-Verlag, New York, 1989.
- 2[2] Arzhantsev I. V., Gröbner bases and systems of algebraic equations (in Russian), Moscow, MCNMO, 2003, 67 pp.
- 3[3] Cox D. A., Little J., O’Shea D., Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra , Springer (1997), ISBN 0-387-94680-2.
- 4[4] Kocak H., Linear Hamiltonian systems are integrable with quadratics, J. Math. Phys. 23 (1982), no. 12, 2375–2380.
- 5[5] Kozlov V. V., Linear systems with a quadratic integral . (Russian) Prikl. Mat. Mekh. 56 (1992), no. 6, pp. 900–906; translation in J. Appl. Math. Mech. 56 (1992), no. 6, pp. 803–809.
- 6[6] Kozlov V. V., Linear Hamiltonian Systems: Quadratic Integrals, Singular Subspaces and Stability , Regul. Chaotic Dyn., 2018, vol. 23, n. 1, pp. 26–46.
- 7[7] Williamson J., An algebraic problem involving the involutory integrals of linear dynamical systems. Amer. J. Math. 62, (1940). 881–911.
- 8[8] Williamson J., On the Algebraic Problem Concerning the Normal Forms of Linear Dynamical Systems. Amer. J. Math. 58 (1936), no. 1, 141–163.
