Related papers: On Ideal Lattices and Gr\"obner Bases
In this paper, the concepts of binomial difference ideals and toric difference varieties are defined and their properties are proved. Two canonical representations for Laurent binomial difference ideals are given using the reduced Groebner…
Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…
We study almost complete intersection ideals in a polynomial ring, generated by powers of all the variables together with a power of their sum. Our main result is an explicit description of the reduced Gr\"obner bases for these ideals under…
Cyclic lattices and ideal lattices were introduced by Micciancio in \cite{D2}, Lyubashevsky and Micciancio in \cite{L1} respectively, which play an efficient role in Ajtai's construction of a collision resistant Hash function (see \cite{M1}…
Let $I = ( f_1, \dots, f_n )$ be a homogeneous ideal in the polynomial ring $K[x_1, \dots,x_n]$ over a field $K$ generated by generic polynomials. Using an incremental approach based on a method by Gao, Guan and Volny, and properties of the…
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 introduce the concept of a Gr\"obner nice pair of ideals in a polynomial ring and we present some applications.
In this paper using the connections between some subvarieties of residuated lattices, we investigated some properties of the lattice of ideals in commutative and unitary rings. We give new characterizations for commutative rings $A$ in…
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…
Minimal Markov bases of configurations of integer vectors correspond to minimal binomial generating sets of the assocciated lattice ideal. We give necessary and sufficient conditions for the elements of a minimal Markov basis to be (a)…
We study a class of combinatorially-defined polynomial ideals which are generated by minors of a generic symmetric matrix. Included within this class are the symmetric determinantal ideals, the symmetric ladder determinantal ideals, and the…
We call an ideal in a polynomial ring robust if it can be minimally generated by a universal Gr\"obner basis. In this paper we show that robust toric ideals generated by quadrics are essentially determinantal. We then discuss two possible…
We present a formalization of Gr\"obner basis theory in Lean 4, built on top of Mathlib's infrastructure for multivariate polynomials and monomial orders. Our development covers the core foundations of Gr\"obner basis theory, including…
The goal of this paper is to deepen the study of multiplicative lattices in the sense of Facchini, Finocchiaro and Janelidze. We provide a sort of Prime Ideal Principle that guarantees that maximal implies prime in a variety of cases (among…
Let $L\subset \mathbb{Z}^n$ be a lattice and $I_L=\langle x^{\bf u}-x^{\bf v}:\ {\bf u}-{\bf v}\in L\rangle$ be the corresponding lattice ideal in $\Bbbk[x_1,\ldots, x_n]$, where $\Bbbk$ is a field. In this paper we describe minimal…
We introduce and study the concept of positive polynomial ideals between Banach lattices. The paper develops the basic principles of these classes and presents methods for constructing positive polynomial ideals from given positive operator…
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…
We show that the universal Gr\"obner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity…
In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y} to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…