Bounds on Regularity of Quadratic Monomial Ideals
Commutative Algebra
2020-07-07 v3 Combinatorics
Abstract
Castelnuovo-Mumford regularity is a measure of algebraic complexity of an ideal. Regularity of monomial ideals can be investigated combinatorially. We use a simple graph decomposition and results from structural graph theory to prove, improve and generalize many of the known bounds on regularity of quadratic square-free monomial ideals.
Cite
@article{arxiv.1906.06358,
title = {Bounds on Regularity of Quadratic Monomial Ideals},
author = {Grigoriy Blekherman and Jaewoo Jung},
journal= {arXiv preprint arXiv:1906.06358},
year = {2020}
}
Comments
12 pages