Related papers: Desingularization of binomial varieties in arbitra…
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…
An algorithm for resolution of singularities in characteristic zero is described. It is expressed in terms of multi-ideals, that essentially are defined as a finite sequence of pairs, each one consiting of a sheaf of ideals and a positive…
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…
We give a combinatorial algorithm for equivariant embedded resolution of singularities of a toric variety defined over a perfect field. The algorithm is realized by a finite succession of blowings-up with smooth invariant centres that…
The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted…
We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
We introduce a construction, called linearization, that associates to any monomial ideal $I$ an ideal $\mathrm{Lin}(I)$ in a larger polynomial ring. The main feature of this construction is that the new ideal $\mathrm{Lin}(I)$ has linear…
We determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated by a set of monomials and one binomial.
A theory of simultaneous resolution of singularities for families of embedded varieties (over a field of characteristic zero) parametrized by the spectrum of a suitable artinian ring, and compatible with a given algorithm of resolution, is…
Algorithms for resolution of singularities in characteristic zero are based on Hironaka's idea of reducing the problem to a simpler question of desingularization of an "idealistic exponent" (or "marked ideal"). How can we determine whether…
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
This paper studies the concept of algorithmic equiresolution of a family of embedded varieties or ideals, which means a simultaneous resolution of such a family compatible with a given (suitable) algorithm of resolution in characteristic…
We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…
In this paper, we prove that every binomial ideal in a polynomial ring over an algebraically closed field of characteristic zero admits a canonical primary decomposition into binomial ideals. Moreover, we prove that this special…
We consider the ideal of inner $2$-minors $I_{\mathcal{P}}$ of a finite set of cells $\mathcal{P}$, which we call the cell ideal of $\mathcal{P}$. A nice interpretation for the height of an unmixed ideal $I_{\mathcal{P}}$, in terms of the…
The aim of this article is to introduce standard bases of ideals in polynomial rings with respect to a class of orderings which are not necessarily semigroup orderings. Our approach generalises the concept of standard bases with respect to…
We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…