Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2
DOI10.1016/j.aim.2012.08.009zbMath1287.14004OpenAlexW2027646475MaRDI QIDQ1759381
Pierre D. Milman, Dima Yu. Grigoriev
Publication date: 20 November 2012
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aim.2012.08.009
polynomial complexitydesingularizationa priori boundbinomial varietiesmultidimensional Euclidean algorithmNash blowings up
Analysis of algorithms and problem complexity (68Q25) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Global theory and resolution of singularities (algebro-geometric aspects) (14E15) Combinatorial complexity of geometric structures (52C45)
Related Items (12)
Cites Work
- Résolution de Nash des points doubles rationnels
- Some properties of the Nash blowingup
- Sandwiched singularities and desingularization of surfaces by normalized Nash transformations
- Introduction to Toric Varieties. (AM-131)
- Desingularization of toric and binomial varieties
- Linear Programming
- On the Jacobian Ideal of the Module of Differentials
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2