arXiv · 1211.4301
Hypergraphs and the Regularity of Square-free Monomial Ideals
Abstract
We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple combinatorial properties of its labeled hypergraph. We also give specific formulas for the regularity of square-free monomial ideals with certain labeled hypergraphs. Furthermore, we prove results in the case of one-dimensional labeled hypergraphs.
Explore related subjects
Keep this discovery
Kuei-Nuan Lin, Jason McCullough. 2013-03-29. Hypergraphs and the Regularity of Square-free Monomial Ideals. https://arxiv.org/abs/1211.4301
Cite the original work for its findings. Save a collection to share your selection of sources.