Papers
Topics
Authors
Recent
Search
2000 character limit reached

Nash modification on toric surfaces

Published 19 Oct 2011 in math.AG | (1110.4346v2)

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 $\C(x_1,x_2)$ be the field of rational functions of a toric surface. Then our result implies that if $\nu:\C(x_1,x_2)\rightarrow\Gamma$ is any valuation centered on the toric surface and such that $\nu(x_1)\neq\lambda\nu(x_2)$ for all $\lambda\in\R\setminus\Q$, then a finite iteration of Nash modification gives local uniformization along $\nu$.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.