The minimal resultant locus
Robert Rumely
Acta Arithmetica, Tome 168 (2015), p. 251-290 / Harvested from The Polish Digital Mathematics Library

Let K be a complete, algebraically closed nonarchimedean valued field, and let φ(z) ∈ K(z) have degree d ≥ 2. We study how the resultant of φ varies under changes of coordinates. For γ ∈ GL₂(K), we show that the map γord(Res(φγ)) factors through a function ordResφ(·) on the Berkovich projective line, which is piecewise affine and convex up. The minimal resultant is achieved either at a single point in P¹K, or on a segment, and the minimal resultant locus is contained in the tree in P¹K spanned by the fixed points and poles of φ. We give an algorithm to determine whether φ has potential good reduction. When φ is defined over ℚ, the algorithm runs in probabilistic polynomial time. If φ has potential good reduction, and is defined over a subfield H ⊂ K, we show there is an extension L/H with [L:H] ≤ (d+1)² such that φ has good reduction over L.

Publié le : 2015-01-01
EUDML-ID : urn:eudml:doc:279136
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-aa169-3-3,
     author = {Robert Rumely},
     title = {The minimal resultant locus},
     journal = {Acta Arithmetica},
     volume = {168},
     year = {2015},
     pages = {251-290},
     zbl = {06451620},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-aa169-3-3}
}
Robert Rumely. The minimal resultant locus. Acta Arithmetica, Tome 168 (2015) pp. 251-290. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-aa169-3-3/