Related papers: Gr\"obner bases of contraction ideals
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
In this paper we compute Gr\"obner bases for determinantal ideals of the form $I_{1}(XY)$, where $X$ and $Y$ are both matrices whose entries are indeterminates over a field $K$. We use the Gr\"obner basis structure to determine Betti…
We describe a generating set for the initial ideal of simplicial toric ideals with respect to the graded reverse lexicographic order, using representations of elements of affine monoids as sums of irreducible elements. Although the…
Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection…
In this note we consider monoidal complexes and their associated algebras, called toric face rings. These rings generalize Stanley-Reisner rings and affine monoid algebras. We compute initial ideals of the presentation ideal of a toric face…
B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a…
In this paper, we introduce techniques for producing normal square-free monomial ideals from old such ideals. These techniques are then used to investigate the normality of cover ideals under some graph operations. Square-free monomial…
Let K be a field and let m_0,...,m_{n} be an almost arithmetic sequence of positive integers. Let C be a toric variety in the affine (n+1)-space, defined parametrically by x_0=t^{m_0},...,x_{n}=t^{m_{n}}. In this paper we produce a minimal…
Gr\"obner bases of binomial ideals arising from finite lattices will be studied. In terms of Gr\"obner bases and initial ideals, a characterization of finite distributive lattices as well as planar distributive lattices will be given.
A celebrated theorem of Fr\"oberg gives a complete combinatorial classification of quadratic square-free monomial ideals with a linear resolution. A generalization of this theorem to higher degree square-free monomial ideals is an active…
Radical binomial ideals associated with finite lattices are studied. Gr\"obner basis theory turns out to be an efficient tool in this investigation.
In this paper, we first show that any square-free monomial ideal in $K[x_1, x_2, x_3, x_4, x_5]$ has the strong persistence property. Next we will provide a criterion for a minimal counterexample to the Conforti-Cornuejols conjecture.…
A homogeneous ideal is robust if its universal Gr\"obner basis is also a minimal generating set. For toric ideals, one has the stronger definition: A toric ideal is strongly robust if its Graver basis equals the set of indispensable…
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…
A \textit{symmetric ideal} $I \subseteq R = K[x_1,x_2,...]$ is an ideal that is invariant under the natural action of the infinite symmetric group. We give an explicit algorithm to find Gr\"obner bases for symmetric ideals in the infinite…
We develop a theory of bicrystalline ideals, synthesizing Gr\"obner basis techniques and Kashiwara's crystal theory. This provides a unified algebraic, combinatorial, and computational approach that applies to ideals of interest, old and…
Using recent work by Erman-Sam-Snowden, we show that finitely generated ideals in the ring of bounded-degree formal power series in infinitely many variables have finitely generated Gr\"obner bases relative to the graded reverse…
In this paper we develop a Grobner bases theory for ideals of partial difference polynomials with constant or non-constant coefficients. In particular, we introduce a criterion providing the finiteness of such bases when a difference ideal…
We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…
Let $G$ be a finite connected simple graph and $I_{G}$ the toric ideal of the edge ring $K[G]$ of $G$. In the present paper, we study finite graphs $G$ with the property that $I_{G}$ is generated by quadratic binomials and $I_{G}$ possesses…