Joins, Ears and Castelnuovo-Mumford regularity
Abstract
We introduce a new class of polynomial ideals associated to a simple graph, . Let be the polynomial ring on the edges of and the polynomial ring on the vertices of . We associate to an ideal, , defined as the preimage of by the map which sends a variable, , associated to an edge , to the product of the variables associated to its vertices. We show that is a one-dimensional, Cohen-Macaulay, graded ring, that is a binomial ideal and that, with respect to a fixed monomial order, its initial ideal has a generating set independent of the field . We focus on the Castelnuovo-Mumford regularity of providing the following sharp upper and lower bounds: where is the maximum vertex join number of the graph and is the number of its connected components. We show that the lower bound is attained for a bipartite graph and use this to derive a new combinatorial result on the number of even length ears of nested ear decomposition.
Keywords
Cite
@article{arxiv.1909.02773,
title = {Joins, Ears and Castelnuovo-Mumford regularity},
author = {Jorge Neves and Maria Vaz Pinto and Rafael H. Villarreal},
journal= {arXiv preprint arXiv:1909.02773},
year = {2019}
}