A multivariable polynomial is associated with a polytope, called its Newton polytope. A polynomial is absolutely irreducible if its Newton polytope is indecomposable in the sense of Minkowski sum of polytopes. Two general constructions of indecomposable polytopes are given, and they give many simple
✦ LIBER ✦
Irreducibility of polynomials modulo p via Newton polytopes
✍ Scribed by Shuhong Gao; Virgı́nia M. Rodrigues
- Book ID
- 108346518
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 184 KB
- Volume
- 101
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Absolute Irreducibility of Polynomials v
✍
Shuhong Gao
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 139 KB
Counting Affine Roots of Polynomial Syst
✍
J.Maurice Rojas; Xiaoshen Wang
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 289 KB
We give a new upper bound on the number of isolated roots of a polynomial system. Unlike many previous bounds, our bound can also be restricted to different open subsets of affine space. Our methods give significantly sharper bounds than the classical Be ´zout theorems and further generalize the mix
Zero-patterns of polynomials and Newton
✍
Alan G.B Lauder
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 138 KB
P-irreducibility of binding polynomials
✍
Lihong Zhi; Zhuojun Liu
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 498 KB
An iterative construction of irreducible
✍
Rafe Jones
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 265 KB
Irreducibility of some Faber polynomials
✍
P. Guerzhoy
📂
Article
📅
2008
🏛
Springer US
🌐
English
⚖ 221 KB