Related papers: Monomial ideals arising from flag complexes whose …

The path ideal (of length t >=2) of a graph G is the monomial ideal, denoted I_t(G), whose generators correspond to the directed paths of length t in G. We study some of the algebraic properties of I_t(G) when G is a tree. We first show…

In this paper, we focus on the associated primes of powers of monomial ideals and asymptotic behavior properties such as normally torsion-freeness, normality, the strong persistence property, and the persistence property. In particular, we…

Given a finite alphabet X and an ordering on the letters, the map \sigma sends each monomial on X to the word that is the ordered product of the letter powers in the monomial. Motivated by a question on Groebner bases, we characterize…

For any ideal $I$ in a Noetherian local ring or any graded ideal $I$ in a standard graded $K$-algebra over a field $K$, we introduce the socle module $\mathrm{Soc}(I)$, whose graded components give us the socle of the powers of $I$. It is…

Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field $K$ and $I$ be a monomial ideal generated in degree $d$. Bandari and Herzog conjectured that a monomial ideal $I$ is polymatroidal if and only if all its monomial…

This article is built upon three main ideas. First, for a class of monomial ideals, it is proven that the multiplicity of an ideal equals the number of realizations of its codimension (an intuitive concept that we define later). Next, for…

Let $I$ be a monomial squarefree ideal of a polynomial ring $S$ over a field $K$ such that the sum of every three different of its minimal prime ideals is the maximal ideal of $S$, or more general a constant ideal. We associate to $I$ a…

Let $K$ be a field of characteristic zero, let $I \subset S = K[x_1,\dots,x_n]$ be a homogeneous ideal, and let $\partial(I)$ be its gradient ideal. We study the relationship between $\mathrm{reg}\,I$ and $\mathrm{reg}\,\partial(I)$. While…

Given a $d \times n$ integer matrix $A$, the main result is an elementary, simple-to-state algorithm that finds the largest $A$-graded ideal contained in any ideal $I$ in a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. The special case where $A$…

We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…

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…

Let $R$ be a commutative ring with unity. The prime ideal sum graph of the ring $R$ is a simple undirected graph whose vertex set is the set of nonzero proper ideals of $R$ and two distinct vertices $I$ and $J$ are adjacent if and only if…

We study the regularity of binomial edge ideals. For a closed graph $G$ we show that the regularity of the binomial edge ideal $J_G$ coincides with the regularity of $\ini_{\lex}(J_G)$ and can be expressed in terms of the combinatorial data…

Let $G$ be a connected and simple graph on the vertex set $[n]$. To the graph $G$ one can associate the generalized binomial edge ideal $J_{m}(G)$ in the polynomial ring $R=K[x_{ij}: i \in [m], j \in [n]]$. We provide a lower bound for the…

For polynomial ideals in positive charachteristic, defining $F$-split rings and admitting a squarefree monomial initial ideal are different notions. In this note we show that, however, there are strong interactions in both directions.…

The Riemann-Roch theorem on a graph G is related to Alexander duality in combinatorial commutive algebra. We study the lattice ideal given by chip firing on G and the initial ideal whose standard monomials are the G-parking functions. When…

Let $K$ be a field, $V$ a $K$-vector space with basis $e_1,\ldots,e_n$, and $E$ the exterior algebra of $V$. To a given monomial ideal $I\subsetneq E$ we associate a special monomial ideal $J$ with generators in the same degrees as those of…

We consider the polynomial ring in finitely many variables over an algebraically closed field of positive characteristic, and initiate the systematic study of ideals preserved by the action of the general linear group by changes of…

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…

Let $G$ be a simple finite graph. A famous theorem of Dirac says that $G$ is chordal if and only if $G$ admits a perfect elimination order. It is known by Fr\"oberg that the edge ideal $I(G)$ of $G$ has a linear resolution if and only if…