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

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

2010-09-03

arxiv.org/abs/1009.0636v1

Mathematics

Commutative Algebra

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Desingularization of binomial varieties in arbitrary characteristic. Part II. Combinatorial desingularization algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Desingularization of binomial varieties in arbitrary characteristic. Part II. Combinatorial desingularization algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Desingularization of binomial varieties in arbitrary characteristic. Part II. Combinatorial desingularization algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-684793