Degree bounds of minimal polynomials and polynomial automorphisms (Q1321043): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:55, 5 March 2024

scientific article
Language Label Description Also known as
English
Degree bounds of minimal polynomials and polynomial automorphisms
scientific article

    Statements

    Degree bounds of minimal polynomials and polynomial automorphisms (English)
    0 references
    0 references
    16 February 1995
    0 references
    Let \(k\) be a field, \(h_ 1,\dots, h_ n\in k[x_ 1,\dots, x_{n-1}]=: k^{[n-1]}\) contain \(n-1\) algebraically independent polynomials. The author has shown earlier, that there exists, up to a non-zero constant factor, a unique irreducible polynomial \(m\) in \(n\) variables such that \(m(h_ 1, \dots,h_ n)=0\), called the minimal polynomial of \(h_ 1,\dots,h_ n\). Here it is proved that \[ \deg m (k^{[n -1]}:\;k(h_ 1,\dots, h_ n))\leq (\max_ j (\deg h_ j))^{n-1}. \] As a consequence a straightforward elementary proof of the degree bound for \(k\)-algebra automorphisms \(F: k^{[n]}\to k^{[n]}\) is obtained, which says that \(\deg (F^{-1})\leq (\deg F)^{n-1}\), \(\deg F\) being the maximum of the total degrees of \(F(x_ i)\), \(i=1,\dots, n\).
    0 references
    0 references
    polynomial automorphisms
    0 references
    degree bounds
    0 references
    minimal polynomial
    0 references

    Identifiers