𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Zero-patterns of polynomials and Newton polytopes

✍ Scribed by Alan G.B Lauder

Book ID
108396251
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
138 KB
Volume
102
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Absolute Irreducibility of Polynomials v
Absolute Irreducibility of Polynomials via Newton Polytopes
✍ Shuhong Gao πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 139 KB

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

Counting Affine Roots of Polynomial Syst
Counting Affine Roots of Polynomial Systems via Pointed Newton Polytopes
✍ 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