Results on the regularity of square-free monomial ideals
type: Item
instance of: scholarly article
title: Results on the regularity of square-free monomial ideals
zbMATH Open document ID: 1299.13017
author: Russ Woodroofe
author: Huy Tài Hà
published in: Advances in Applied Mathematics
publication date: 2014-08-29T00:00:00Z
full work available at URL: https://arxiv.org/abs/1301.6779
reviewed by: Dang Hop Nguyen
Mathematics Subject Classification ID: 13D02
Mathematics Subject Classification ID: 13F20
Mathematics Subject Classification ID: 05E40
Mathematics Subject Classification ID: 55U10
zbMATH DE Number: 6335978
zbMATH Keywords: Castelnuovo-Mumford regularity
zbMATH Keywords: squarefree monomial ideal
zbMATH Keywords: hypergraph
zbMATH Keywords: simplicial complex
zbMATH Keywords: matching number
MaRDI profile type: Publication
OpenAlex ID: W3098077435
arXiv ID: 1301.6779
cites work: Transversal numbers for hypergraphs arising in geometry
cites work: Q4871782
cites work: Shellable Nonpure Complexes and Posets. I
cites work: Shellable nonpure complexes and posets. II
cites work: Path ideals of rooted trees and their graded Betti numbers
cites work: Q3592292
cites work: Bounds on the regularity and projective dimension of ideals associated to graphs
cites work: Algebraic shifting and sequentially Cohen-Macaulay simplicial complexes
cites work: Splittings of monomial ideals
cites work: Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
cites work: A Generalization of the Taylor Complex Construction
cites work: Monomial Ideals
cites work: Intersections of Leray complexes and regularity of monomial ideals
cites work: Non-vanishingness of Betti numbers of edge ideals
cites work: General lexicographic shellability and orbit arrangements
cites work: Regularity, depth and arithmetic rank of bipartite edge ideals
cites work: Q5462454
cites work: Bounds for the regularity of edge ideal of vertex decomposable and shellable graphs
cites work: Edge ideals: algebraic and combinatorial properties
cites work: Regularity of edge ideals of \(C_{4}\)-free graphs via the topology of the lcm-lattice
cites work: Combinatorics and commutative algebra.
cites work: Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity
cites work: Q4528984
cites work: Obstructions to shellability
cites work: Vertex decomposable graphs and obstructions to shellability
cites work: Matchings, coverings, and Castelnuovo-Mumford regularity
DOI: 10.1016/J.AAM.2014.05.002
review text: Let \(k\) be a field and \(R=k[x_1,\ldots,x_n]\) a graded polynomial ring over \(k\) with variables having degree \(1\) (where \(n\geq 1\)). The paper studies squarefree monomial ideals in \(R\), which are in one-to-one correspondence with simple hypergraphs over the vertex set \(\{x_1,\ldots,x_n\}\). For a simple hypergraph \(\mathcal{H}\) with the edge set \(\mathcal E\), denote \(I(\mathcal H)=(x^e: e\in \mathcal E)\) the edge ideal of \(\mathcal H\). One wants to bound/compute the regularity \(\text{reg}~ I(\mathcal H)\) in terms of the combinatorics of \(\mathcal H\).NEWLINENEWLINEThe first main result gives an upper bound for \(\text{reg}~ I(\mathcal H)\) in terms of the 2-collages of \(\mathcal H\). A set of edges of \(\mathcal H\) is a 2-collage if for every edge \(E\) there exists an edge \(F\) in the 2-collage such that \(E\setminus F\) has at most 1 element. Then we have the following:NEWLINENEWLINETheorem 1.2. For any 2-collage \(E_1,\ldots, E_c\) of \(\mathcal H\), there is an inequality NEWLINE\[CARRIAGE_RETURNNEWLINE\text{reg}~ I(\mathcal H)\leq \sum_{i=1}^{c}(|E_i|-1).CARRIAGE_RETURNNEWLINE\]NEWLINENEWLINENEWLINEIn the case when \(\mathcal H\) is a simple graph, i.e., every edge of \(\mathcal H\) has 2 elements, Theorem 1.2 implies a result proven by \textit{H. T. Hà} and \textit{A. Van Tuyl} [J. Algebr. Comb. 27, No. 2, 215--245 (2008; Zbl 1147.05051)]. The proof is based on Kalai-Meshulam's theorem on regularity of sum of squarefree monomial ideals [\textit{G. Kalai} and \textit{R. Meshulam}, J. Comb. Theory, Ser. A 113, No. 7, 1586--1592 (2006; Zbl 1105.13026)].NEWLINENEWLINEThe second main result gives an instance where regularity can be computed recursively:NEWLINENEWLINE Theorem 1.5. The equality \(\text{reg}~ I=\max\{\text{reg}~ (I+(x)),\text{reg}~ (I:x)+1\}\) holds for \(I\) being the edge ideal of a vertex-decomposable hypergraph, and \(x\) be the initial vertex in its shedding order.NEWLINENEWLINELet \(\mathcal H=G\), a simple graph.NEWLINE…
description: scientific article; zbMATH DE number 6335978