English
Related papers

Related papers: Matchings, Squarefree Powers and Betti Splittings

200 papers

Let $K$ be a field and $S = K[x_1,\dots,x_n]$ be a polynomial ring over $K$. We discuss the behaviour of the extremal Betti numbers of the class of squarefree strongly stable ideals. More precisely, we give a numerical characterization of…

Commutative Algebra · Mathematics 2021-10-01 Luca Amata , Marilena Crupi

In this paper we study squarefree monomial ideals which have constant depth functions. Edge ideals, matroidal ideals and facet ideals of pure simplicial forests connected in codimension one with this property are classified.

Commutative Algebra · Mathematics 2012-09-27 Jürgen Herzog , Marius Vladoiu

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}$. Assume that $G$ is a graph with edge ideal $I(G)$. We prove that the modules $S/\overline{I(G)^k}$ and…

Commutative Algebra · Mathematics 2018-08-13 S. A. Seyed Fakhari

Let $(R,\mm)$ be a Noetherian local ring and $M$ a finitely generated $R$-module. We say $M$ has maximal depth if there is an associated prime $\pp$ of $M$ such that $\depth M=\dim R/\pp$. In this paper we study squarefree monomial ideals…

Commutative Algebra · Mathematics 2019-07-30 Ahad Rahimi

Let $R=\mathbb{K}[x_1,\dots,x_n]$, a graded algebra $S=R/I$ satisfies $N_{k,p}$ if $I$ is generated in degree $k$, and the graded minimal resolution is linear the first $p$ steps, and the $k$-index of $S$ is the largest $p$ such that $S$…

Commutative Algebra · Mathematics 2025-10-14 Chwas Ahmed , Ralf Fröberg , Mohammed Rafiq Namiq

The index of a graded ideal measures the number of linear steps in the graded minimal free resolution of the ideal. In this paper we study the index of powers and squarefree powers of edge ideals. Our results indicate that the index as a…

Commutative Algebra · Mathematics 2021-03-17 Mina Bigdeli , Juergen Herzog , Rashid Zaare-Nahandi

A Betti splitting $I=J+K$ of a monomial ideal $I$ ensures the recovery of the graded Betti numbers of $I$ starting from those of $J,K$ and $J \cap K$. In this paper, we introduce this condition for simplicial complexes, and, by using…

Combinatorics · Mathematics 2018-04-30 Davide Bolognini , Ulderico Fugacci

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…

Commutative Algebra · Mathematics 2016-04-05 S. A. Seyed Fakhari

For the almost complete intersection ideals $(x_1^2, \dots, x_n^2, (x_1 + \cdots + x_n)^k)$, we compute their reduced Gr\"obner basis for any term ordering, revealing a combinatorial structure linked to lattice paths, elementary symmetric…

Let $G$ be a unicyclic graph with edge ideal $I(G)$. For any integer $s\geq 1$, we denote the $s$-th symbolic power of $I(G)$ by $I(G)^{(s)}$. It is shown that ${\rm reg}(I(G)^{(s)})={\rm reg}(I(G)^s)$, for every $s\geq 1$.

Commutative Algebra · Mathematics 2019-03-27 S. A. Seyed Fakhari

This paper produces a recursive formula of the Betti numbers of certain Stanley-Reisner ideals (graph ideals associated to forests). This gives a purely combinatorial definition of the projective dimension of these ideals, which turns out…

Commutative Algebra · Mathematics 2007-05-23 Sean Jacques , Mordechai Katzman

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Alavi, Erd\H{o}s, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequence $\{i_t(G)\}_{t\geq 0}$ of $G$ is unimodal; Levit and…

Combinatorics · Mathematics 2012-06-27 David Galvin

We consider the convex hull $P_{\varphi}(G)$ of all satisfying assignments of a given MSO formula $\varphi$ on a given graph $G$. We show that there exists an extended formulation of the polytope $P_{\varphi}(G)$ that can be described by…

Data Structures and Algorithms · Computer Science 2023-06-22 Petr Kolman , Martin Koutecký , Hans Raj Tiwary

We prove that multigraded Betti numbers of a simplicial forest are always either 0 or 1. Moreover a nonzero multidegree appears exactly at one homological degree in the resolution. Our work generalizes work of Bouchat on edge ideals of…

Commutative Algebra · Mathematics 2015-09-07 Nursel Erey , Sara Faridi

Let $G$ be a simple graph on $n$ vertices, and let $J_G$ denotes the corresponding binomial edge ideal in $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$, where $\mathbb{K}$ is a field. We show that if a vertex satisfies a certain degree…

Commutative Algebra · Mathematics 2025-12-03 Kanoy Kumar Das , Rajiv Kumar , Paramhans Kushwaha

We give a sufficient condition for a monomial ideal to have a nonzero Betti number in each multidegree. In the case of facet ideals of simplicial forests, this condition becomes a necessary one and it allows us to characterize Betti…

Commutative Algebra · Mathematics 2017-08-29 Nursel Erey , Sara Faridi

We obtain first order linear partial differential equations which are satisfied by exponential generating functions of two variables for the number of connected bipartite graphs with given Betti number. By solving these equations…

Combinatorics · Mathematics 2023-05-16 Taro Hasui , Tomoyuki Shirai , Satoshi Yabuoku

Using the concept of vector partition functions, we investigate the asymptotic behavior of graded Betti numbers of powers of homogeneous ideals in a polynomial ring over a field. Our main results state that if the polynomial ring is…

Commutative Algebra · Mathematics 2020-06-03 Amir Bagheri , Kamran Lamei

For each integer k >= 2, we determine a sharp bound on mad(G) such that V(G) can be partitioned into sets I and F_k, where I is an independent set and G[F_k] is a forest in which each component has at most k vertices. For each k we…

Combinatorics · Mathematics 2021-10-06 Daniel W. Cranston , Matthew P. Yancey

We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…