Ultrametric root counting

MaRDI QIDQ3083077zbMATH OpenFDO

Authors

Publication date 18 March 2011

Full work available at URL https://arxiv.org/abs/0901.3393, http://www.math.uh.edu/~hjm/Vol36-4.html

zbMATH Keywords

Newton's polygonroot countingSturm's Theoremultrametric fieldsvaluation fields

Mathematics Subject Classification ID

Polynomials (11S05) Number-theoretic algorithms; complexity (11Y16)

Abstract: Let $K$ be a complete non-archimedean field with a discrete valuation, $finK[X]$ a polynomial with non-vanishing discriminant, $A$ the valuation ring of $K$, and $M$ the maximal ideal of $A$. The first main result of this paper is a reformulation of Hensel's lemma that connects the number of roots of $f$ with the number of roots of its reduction modulo a power of $M$. We then define a condition --- {em regularity} --- that yields a simple method to compute the exact number of roots of $f$ in $K$. In particular, we show that regularity implies that the number of roots of $f$ equals the sum of the numbers of roots of certain binomials derived from the Newton polygon.

Recommendations

• Multivariate ultrametric root counting
• scientific article; zbMATH DE number 2177636
• Arithmetic multivariate Descartes' rule
• scientific article; zbMATH DE number 61550
• Hölder continuity of roots of complex and p-adic polynomials

Cited in

(4)

• The number of roots of a lacunary bivariate polynomial on a line
• Multivariate ultrametric root counting
• scientific article; zbMATH DE number 61550 (Why is no real title available?)
• Sharp bounds for the number of roots of univariate fewnomials

This page was built for publication: Ultrametric root counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083077)