Decomposition of polytopes and polynomials (Q5939542): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (5 intermediate revisions by 5 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00454-001-0024-0 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2125173284 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0012099 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00454-001-0024-0 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:05, 9 December 2024
scientific article; zbMATH DE number 1626140
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decomposition of polytopes and polynomials |
scientific article; zbMATH DE number 1626140 |
Statements
Decomposition of polytopes and polynomials (English)
0 references
15 November 2001
0 references
It was observed by \textit{A. Ostrowski} in Deutsche Math.-Ver. 30, 98--99 (1921; JFM 48.0106.01), that if a polynomial factors, then its Newton polytope decomposes, in the sense of the Minkowski sum, into the Newton polytopes of the factors. The authors present a ``pseudopolynomial-time'' algorithm [see \textit{M. R. Garey} and \textit{D. S. Johnson}, Computers and intractability: a guide to the theory of NP-completeness, Freeman, New York (1979; Zbl 0411.68039)] for testing indecomposability. Applications of the algorithms include absolute irreducibility testing and factorization of polynomials via their Newton polytopes.
0 references
Newton polytope
0 references
decomposition algorithms
0 references
irreducibility and factorization
0 references
indecomposability
0 references
