Nash modification on toric curves
Abstract
We revisit the problem of resolution of singularities of toric curves by iterating Nash modification. We give a bound on the number of iterations required to obtain the resolution. We also introduce a different approach on counting iterations by dividing the combinatorial algorithm of Nash modification of toric curves into several division algorithms.
0
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.