Indecomposability of polynomials via Jacobian matrix (Q984987)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Indecomposability of polynomials via Jacobian matrix |
scientific article; zbMATH DE number 5758103
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Indecomposability of polynomials via Jacobian matrix |
scientific article; zbMATH DE number 5758103 |
Statements
Indecomposability of polynomials via Jacobian matrix (English)
0 references
20 July 2010
0 references
A multivariate polynomial is called decomposable if it can be written as a composition of a univariate polynomial of degree \(\geq 2\) and a multivariate polynomial. In the first section, deomposability is characterized by a rank condition of the so-called Jacobi-matrix of the polynomial. For characteristic zero, this criterion can be found in [\textit{Y. Stein}, Isr. J. Math. 68, No. 1, 109--122 (1989; Zbl 0716.12001)]. Here the result is generalized to positive characteristics. Based on this criterion, some classes of polynomials are shown to be indecomposable.
0 references
indecomposable polynomials
0 references
Noether's theorem
0 references
Bertini's theorem
0 references
Ostrowski's theorem
0 references
Newton's polygon
0 references
0 references