Abstract
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.
Keywords
- Resolution of singularities
- Binomial ideals
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bierstone, E., Milman, P.: Desingularization of toric and binomial varieties. J. Algebraic Geom. 15(3), 443–486 (2006)
Blanco, R.: Combinatorial resolution of binomial ideals in arbitrary characteristic (preprint) arXiv:0902.2887v1 [math.AG]
Blanco, R., Encinas, S.: Embedded desingularization of toric varieties. Journal of Symbolic Computation: Special Issue, Symbolic and Algebraic Computation (accepted for publication) (preprint) arXiv:0901.2211v2 [math.AG]
Cox, D.: Toric varieties and toric resolutions. In: Resolution of Singularities (Obergurgl, 1997). Progr. Math., vol. 181, pp. 259–284. Birkhäuser, Basel (2000)
González Pérez, P.D., Teissier, B.: Embedded resolutions of non necessarily normal affine toric varieties. C. R. Math. Acad. Sci. Paris 334(5), 379–382 (2002)
Eisenbud, D., Sturmfels, B.: Binomial ideals. Duke Math. J. 84(1), 1–45 (1996)
Kempf, G., Knudsen, F.F., Mumford, D., Saint-Donat, B.: Toroidal embeddings. I. LNM, vol. 339. Springer, Berlin (1973)
Teissier, B.: Monomial ideals, binomial ideals, polynomial ideals. In: Trends in Commutative Algebra. Math. Sci. Res. Inst. Publ., vol. 51, pp. 211–246. Cambridge Univ. Press, Cambridge (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blanco, R. (2010). A New Desingularization Algorithm for Binomial Varieties in Arbitrary Characteristic. In: Fukuda, K., Hoeven, J.v.d., Joswig, M., Takayama, N. (eds) Mathematical Software – ICMS 2010. ICMS 2010. Lecture Notes in Computer Science, vol 6327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15582-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-15582-6_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15581-9
Online ISBN: 978-3-642-15582-6
eBook Packages: Computer ScienceComputer Science (R0)
