Related papers: The Gr\"obner basis for powers of a general linear…
We study powers of binomial edge ideals associated with closed and block graphs.
In this note we show that the initial ideal of the annihilator ideal of a generic form is generated by the largest possible monomials in each degree. We also show that the initial ideal with respect to the degree reverse lexicographical…
For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…
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…
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$…
Let A = bigoplus_{i >= 0} A_i be a standard graded Artinian K-algebra, where char K = 0. Then A has the Weak Lefschetz property if there is an element ell of degree 1 such that the multiplication times ell : A_i --> A_{i+1} has maximal…
We focus on Gr\"obner bases for modules of univariate polynomial vectors over a ring. We identify a useful property, the "predictable leading monomial (PLM) property" that is shared by minimal Gr\"{o}bner bases of modules in F[x]^q, no…
In this note we generalize the main result in [DIV: R. Di Gennaro, G. Ilardi, J. Valles, Singular hypersurfaces characterizing the Lefschetz properties J. Lond. Math. Soc. (2) 89 (2014), no. 1, 194-212] on artinian ideals failing Lefschetz…
Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of polynomials that automatically generates a Gr\"obner basis…
We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs…
We deal with the complete-intersection property of maximally differential ideals. Also, we connect the Gorenstein homology of derivations to the Gorenstein property of the base rings. These equipped with some applications.
On a non-compact, smooth, connected, boundaryless, complete Riemannian manifold $(M,g)$, one can define its ideal boundary by rays (or equivalently, Busemann functions). From the viewpoint of Mather theory, boundary elements could be…
Let $R = K[x_1, x_2, x_3, x_4]$ be the polynomial ring over a field of characteristic zero. For the ideal $(x_1^a, x_2^b, x_3^c, x_4^d) \subset R$, where at least one of $a$, $b$, $c$ and $d$ is equal to two, we prove that its generic…
We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…
In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.
A toric ideal is called robust if its universal Gr\"obner basis is a minimal set of generators, and is called generalized robust if its universal Gr\"obner basis equals its universal Markov basis (the union of all its minimal sets of…
In this paper, we characterize the (generalized) Frobenius powers and critical exponents of two classes of monomial ideals of a polynomial ring in positive characteristic: powers of the homogeneous maximal ideal, and ideals generated by…
A graded Artinian algebra $A$ has the Weak Lefschetz Property if there exists a linear form $\ell$ such that the multiplication map by $\ell:[A]_i\to [A]_{i+1}$ has maximum rank in every degree. The linear forms satisfying this property…
In this work, two algorithms are developed related to lattice codes. In the first one, an extended complete Gr\"obner basis is computed for the label code of a lattice. This basis supports all term orderings associated with a total degree…