Nash modification on toric surfaces
Abstract
It has been recently shown that the iteration of Nash modification on not necessarily normal toric varieties corresponds to a purely combinatorial algorithm on the generators of the semigroup associated to the toric variety. We will show that for toric surfaces this algorithm stops for certain choices of affine charts of the Nash modification. In addition, we give a bound on the number of steps required for the algorithm to stop in the cases we consider. Let (x1,x2) be the field of rational functions of a toric surface. Then our result implies that if :(x1,x2)→ is any valuation centered on the toric surface and such that (x1)≠λ(x2) for all λ∈, then a finite iteration of Nash modification gives local uniformization along .
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.