✦ LIBER ✦

Newton polygons and families of polynomials

✍ Scribed by Arnaud Bodin

Publisher: Springer
Year: 2004
Tongue: English
Weight: 152 KB
Volume: 113
Category: Article
ISSN: 0025-2611
DOI: 10.1007/s00229-004-0440-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Estimation of Lojasiewicz exponents and

Estimation of Lojasiewicz exponents and Newton polygons

✍ Ben Lichtin 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 588 KB

MILNOR Number of Complete Intersections

MILNOR Number of Complete Intersections and NEWTON Polygons

✍ Bernd Martin; Gerhard Pfister 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 744 KB

The main result of this 1)aper will he a formula to compute the Milnor number of an isolated complete intersection singulaFity using the Newton polygon. We were inspired by the articles of KOUCHNIRENKO [4], who gave such a formula for hyl)ersurfaces, anti GREUEL and HAMM [2], who proved a similar re

Newton polygons and topological determin

Newton polygons and topological determinacy of analytic germs

✍ W. Kucharz 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 248 KB

Newton Polygons of L Functions Associate

Newton Polygons of L Functions Associated with Exponential Sums of Polynomials of Degree Four over Finite Fields

✍ Shaofang Hong 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 226 KB

DEDICATED TO PROFESSOR CHAO KO ON THE OCCASION OF HIS 90TH BIRTHDAY Let F O be the "nite "eld of q elements with characteristic p and F O K its extension of degree m. Fix a nontrivial additive character of ). The corresponding ¸functions are de"ned by ¸( f, t)"exp( K S K ( f )tK/m). In this paper,

Chromatic polynomials, polygon trees, an

Chromatic polynomials, polygon trees, and outerplanar graphs

✍ C. D. Wakelin; D. R. Woodall 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB

## Abstract It is proved that all classes of polygon trees are characterized by their chromatic polynomials, and a characterization is given of those polynominals that are chromatic polynomials of outerplanar graphs. The first result yields an alternative proof that outerplanar graphs are recogniza

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