Related papers: Constructing a Gr\"obner basis of Griffin's ideal
We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…
Let $I\subset S$ be a graded ideal of a standard graded polynomial ring $S$ with coefficients in a field $K$, and let $\text{v}(I)$ be the $\text{v}$-number of $I$. In previous work, we showed that for any graded ideal $I\subset S$…
We study an inductive method of computing initial ideals and Gr\"obner bases for families of ideals in a polynomial ring. This method starts from a given set of pairs $(I,J)$ where $I$ is any ideal and $J$ is a monomial ideal contained in…
In this work, we provide a necessary and sufficient condition on a polyomino ideal for having the set of inner 2-minors as degree reverse lexicographic Gr\"obner basis, due to combinatorial properties of the polyomino itself. Moreover, we…
We introduce balanced polyominoes and show that their ideal of inner minors is a prime ideal and has a quadratic Gr\"obner basis with respect to any monomial order, and we show that any row or column convex and any tree-like polyomino is…
In this paper we study monomial ideals attached to posets, introduce generalized Hibi rings and investigate their algebraic and homological properties. The main tools to study these objects are Groebner basis theory, the concept of…
The theory of "subalgebra basis" analogous to standard basis (the generalization of Gr\"{o}bner bases to monomial ordering which are not necessarily well ordering \cite{GP1}.) for ideals in polynomial rings over a field is developed. We…
We characterise the class of one-cogenerated Pfaffian ideals whose natural generators form a Gr\"obner basis with respect to any anti-diagonal term-order. We describe their initial ideals as well as the associated simplicial complexes,…
This paper extends the article of the Bruns and Conca on SAGBI bases and their computation (J. Symb. Comput. 120 (2024)) in two directions. (i) We describe the extension of the Singular library sagbiNormaliz.sing to the computation of…
Exploiting symmetry in Groebner basis computations is difficult when the symmetry takes the form of a group acting by automorphisms on monomials in finitely many variables. This is largely due to the fact that the group elements, being…
We introduce the notion of monomial group action and study some of its consequences for Groebner basis theory. As an application we prove a conjecture of V. Batyrev and O. Popov describing the Cox rings of Del Pezzo surfaces (of degree at…
The brain processes information about the environment via neural codes. The neural ideal was introduced recently as an algebraic object that can be used to better understand the combinatorial structure of neural codes. Every neural ideal…
We give a descent monomial basis of $\Delta$-Springer modules $R_{n,\lambda,s}$, first defined by Griffin. Our construction simultaneously generalizes the descent basis for the Garsia-Procesi module $R_\lambda$ studied by Carlsson-Chou and…
There is a longstanding conjecture by Fr\"oberg about the Hilbert series of the ring $R/I$, where $R$ is a polynomial ring, and $I$ an ideal generated by generic forms. We prove this conjecture true in the case when $I$ is generated by a…
Let J be a strongly stable monomial ideal in S=K[x_1,...,x_n] and let Mf(J) be the family of all homogeneous ideals I in S such that the set of all terms outside J is a K-vector basis of the quotient S/I. We show that an ideal I belongs to…
We establish a novel connection between the central binomial coefficients $\binom{2n}{n}$ and Gould's sequence through the construction of a specialized multivariate polynomial quotient ring. Our ring structure is characterized by ideals…
In this paper, we give a sufficient condition for a set $\mathal G$ of polynomials to be a Gr\"obner basis with respect to a given term-order for the ideal $I$ that it generates. Our criterion depends on the linkage pattern of the ideal $I$…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
We investigate Rees algebras and special fiber rings obtained by blowing up specialized Ferrers ideals. This class of monomial ideals includes strongly stable monomial ideals generated in degree two and edge ideals of prominent classes of…
Gr\"{o}bner bases are nowadays central tools for solving various problems in commutative algebra and algebraic geometry. A typical use of Gr\"{o}bner bases is the multivariate polynomial system solving, which enables us to construct…