Related papers: Depth and regularity of monomial ideals via polari…

We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.

A key question in the analysis of discrete models for material defects, such as vortices in spin systems and superconductors or isolated dislocations in metals, is whether information on boundary energy for a domain can be sufficient for…

Let $I$ be a weakly polymatroidal ideal or a squarefree monomial ideal of a polynomial ring $S$. In this paper we provide a lower bound for the Stanley depth of $I$ and $S/I$. In particular we prove that if $I$ is a squarefree monomial…

Given a nonincreasing function $f : \mathbb{Z}_{\geq 0} \setminus \{ 0 \} \to \mathbb{Z}_{\geq 0}$ such that (i) $f(k) - f(k+1) \leq 1$ for all $k \geq 1$ and (ii) if $a = f(1)$ and $b = \lim_{k \to \infty} f(k)$, then $|f^{-1}(a)| \leq…

Let $I$ be a monomial ideal in a polynomial ring $S=K[x_1,\ldots,x_n]$ over a field $K$ with $n=2$ or $3$, and let $\overline{I}$ be its integral closure. We will show that $\text{reg} (\overline{I}) \le \text{reg} (I)$. Furthermore, if $I$…

For a given clutter $\mathcal{C}$, let $I:=I ( \bar{\mathcal{C}} )$ be the circuit ideal in the polynomial ring $S$. In this paper, we show that the Betti numbers of $I$ and $I + ( \textbf{x}_F )$ are the same in their non-linear strands,…

In this paper, we explicitly give combinatorial formulas for the regularity of powers of edge ideals, $\reg(I(D)^k)$, of weighted oriented unmixed forests $D$ whose leaves are sinks ($V^+(D)$ are sinks). This combinatorial formula is a…

Let $\Delta$ be a simplicial complex of a matroid $M$. In this paper, we explicitly compute the regularity of all the symbolic powers of a Stanley-Reisner ideal $I_\Delta$ in terms of combinatorial data of the matroid $M$. In order to do…

In this paper, we introduce the notion of binomial edge ideals of a clutter and obtain results similar to those obtained for graphs by Rauf \& Rinaldo in \cite{raufrin}. We also answer a question posed in their paper.

We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let $G$ be a unicyclic graph with a unique odd cycle and $I=I(G)$ be its edge ideal. We compute the exact values of all symbolic defects of $I$ using the…

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

Recently, H. Dao and R. Nair gave a combinatorial description of simplicial complexes $\Delta$ such that the squarefree reduction of the Stanley-Reisner ideal of $\Delta$ has the WLP in degree $1$ and characteristic zero. In this paper, we…

In this paper, we study the two natural polarizations, namely the standard polarization and the box polarization, of the d-th power of the maximal ideal in a polynomial ring. We show that these polarizations correspond to smooth points in…

Let $S={\sf k}[X_1,\dots, X_n]$ be a polynomial ring, where ${\sf k}$ is a field. This article deals with the defining ideal of the Rees algebra of squarefree monomial ideal generated in degree $n-2$. As a consequence, we prove that Betti…

This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative…

Relying on the combinatorial classification of toric ideals using their bouquet structure, we focus on toric ideals of hypergraphs and study how they relate to general toric ideals. We show that hypergraphs exhibit a surprisingly general…

We use initially regular sequences that consist of linear sums to explore the depth of $R/I^2$, when $I$ is a monomial ideal in a polynomial ring $R$. We give conditions under which these linear sums form regular or initially regular…

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{K}$. Let $G$ be a graph with $n$ vertices. Assume that $I=I(G)$ is the edge ideal of $G$ and $J=J(G)$ is its cover ideal. We…

Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal…

We study homological properties of random quadratic monomial ideals in a polynomial ring $R = {\mathbb K}[x_1, \dots x_n]$, utilizing methods from the Erd\"{o}s-R\'{e}nyi model of random graphs. Here for a graph $G \sim G(n, p)$ we consider…