Locally Finite and Locally Nilpotent Derivations with Applications to Polynomial Flows and Polynomial Morphism (Q4031471)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 149140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Locally Finite and Locally Nilpotent Derivations with Applications to Polynomial Flows and Polynomial Morphism |
scientific article; zbMATH DE number 149140 |
Statements
Locally Finite and Locally Nilpotent Derivations with Applications to Polynomial Flows and Polynomial Morphism (English)
0 references
1 April 1993
0 references
polynomial flow
0 references
autonomous systems
0 references
derivations on polynomial rings
0 references
Lorenz equations
0 references
Maxwell-Bloch equations
0 references
0.82433516
0 references
0.7568303
0 references
0 references
0.72189605
0 references
0.7204584
0 references
0.7142716
0 references
0.7137229
0 references
A class of autonomous systems, \(\dot y = V(y)\), \(y(0) = x \in R^ n\), where \(V\) is a \(C^ 1\)-vector field on \(R^ n\), is that having polynomial flow, i.e., the solution depends polynomially upon the initial conditions. A well known result of \textit{B. Coomes} and \textit{V. Zurkowski} [J. Dyn. Differ. Equations 3, No. 1, 29-66 (1991; Zbl 0728.34001)] shows that an autonomous system has polynomial flow if and only if the derivation induced by the vector field that defines the system on the \(n\)-variable polynomial ring is locally finite. In this paper the author studies the notion of locally finite and locally nilpotent derivations on a commutative algebra obtaining simple results on them and then applies these results to prove that the Lorenz system and the Maxwell-Bloch equations have no polynomial flows. These results were proved before with some restrictions and in a more complicated way. Moreover, the author provides an algorithm that decides if a derivation on a polynomial ring in two variables is locally finite. This algorithm is easily programmable with any language of symbolic computation. Using this algorithm the author obtains a new proof of the classification theorem of Bass and Meisters concerning vector fields on \(R^ 2\). A section about the automorphism group of polynomial rings is included. In this section the author gives an equivalent formulation of the Jacobian conjecture in terms of locally nilpotent derivations. A good survey on this conjecture is one of the same author in [Computational aspects of Lie group representations and related topics, Proc. Comput. Algebra Semin., Amsterdam/Neth. 1990, CWI Tracts 84, 29-44 (1991; Zbl 0742.14008)].
0 references