Results on the regularity of square-free monomial ideals

From MaRDI portal
Publication:403387

DOI10.1016/J.AAM.2014.05.002zbMATH Open1299.13017arXiv1301.6779OpenAlexW3098077435MaRDI QIDQ403387FDOQ403387


Authors: Russ Woodroofe, Huy Tài Hà Edit this on Wikidata


Publication date: 29 August 2014

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: In a 2008 paper, the first author and Van Tuyl proved that the regularity of the edge ideal of a graph G is at most one greater than the matching number of G. In this note, we provide a generalization of this result to any square-free monomial ideal. We define a 2-collage in a simple hypergraph to be a collection of edges with the property that for any edge E of the hypergraph, there exists an edge F in the collage such that |E F| < 2. The Castelnuovo-Mumford regularity of the edge ideal of a simple hypergraph is bounded above by a multiple of the minimum size of a 2-collage. We also give a recursive formula to compute the regularity of a vertex-decomposable hypergraph. Finally, we show that regularity in the graph case is bounded by a certain statistic based on maximal packings of nondegenerate star subgraphs.


Full work available at URL: https://arxiv.org/abs/1301.6779




Recommendations




Cites Work


Cited In (33)





This page was built for publication: Results on the regularity of square-free monomial ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403387)