Ultrametric Root Counting

Details Ultrametric Root Counting Ultrametric Root Counting

2009-01-22

arxiv.org/abs/0901.3393v5

Mathematics

Algebraic Geometry

10 pages and 2 figures

Scientific paper

Let $K$ be a complete non-archimedean field with a discrete valuation, $f\in K[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.

Affiliated with

Also associated with

No associations

Rating

Ultrametric Root Counting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Ultrametric Root Counting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ultrametric Root Counting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-188991