Desingularization of binomial varieties in arbitrary characteristic. II: Combinatorial desingularization algorithm

From MaRDI portal
Publication:3145522

DOI10.1093/QMATH/HAR019zbMATH Open1274.14015arXiv1009.0636OpenAlexW2963925037MaRDI QIDQ3145522FDOQ3145522

Rocío Blanco

Publication date: 21 December 2012

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Abstract: In this paper we construct a combinatorial algorithm of resolution of singularities for binomial ideals, over a field of arbitrary characteristic. This algorithm is applied to any binomial ideal. This means ideals generated by binomial equations without any restriction, including monomials and p-th powers, where p is the characteristic of the base field. In particular, this algorithm works for toric ideals. However, toric geometry tools are not needed, the algorithm is constructed following the same point of view as Villamayor algorithm of resolution of singularities in characteristic zero.


Full work available at URL: https://arxiv.org/abs/1009.0636




Recommendations




Cited In (8)





This page was built for publication: Desingularization of binomial varieties in arbitrary characteristic. II: Combinatorial desingularization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3145522)