A new desingularization algorithm for binomial varieties in arbitrary characteristic

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Blanco, R. (2010). A new desingularization algorithm for binomial varieties in arbitrary characteristic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6327 LNCS, pp. 217–220). https://doi.org/10.1007/978-3-642-15582-6_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free