Joins, Ears and Castelnuovo-Mumford regularity

TL;DR

This paper introduces a new class of polynomial ideals linked to graphs, studies their algebraic properties, and establishes bounds on their Castelnuovo-Mumford regularity, connecting algebraic invariants to graph combinatorics.

Contribution

It defines a novel ideal associated with a graph, analyzes its algebraic structure, and derives bounds on its regularity, linking algebraic and combinatorial properties.

Findings

The ring K[E_G]/I(X_G) is Cohen-Macaulay and one-dimensional.

The initial ideal of I(X_G) has a field-independent generating set.

Bounds on regularity are established, with the lower bound achieved for bipartite graphs.

Abstract

We introduce a new class of polynomial ideals associated to a simple graph, $G$. Let $K[E_G]$ be the polynomial ring on the edges of $G$ and $K[V_G]$ the polynomial ring on the vertices of $G$. We associate to $G$ an ideal, $I(X_G)$, defined as the preimage of $(x_i^2-x_j^2 : i,j\in V_G)\subseteq K[V_G]$ by the map $K[E_G]\to K[V_G]$ which sends a variable, $t_e$, associated to an edge $e=\{i,j\}$, to the product $x_ix_j$ of the variables associated to its vertices. We show that $K[E_G]/I(X_G)$ is a one-dimensional, Cohen-Macaulay, graded ring, that $I(X_G)$ is a binomial ideal and that, with respect to a fixed monomial order, its initial ideal has a generating set independent of the field $K$. We focus on the Castelnuovo-Mumford regularity of $I(X_G)$ providing the following sharp upper and lower bounds: $$ \mu(G) \leq \operatorname{reg} I(X_G) \leq |V_G|-b_0(G)+1, $$ where $\mu(G)$ is the maximum vertex join number of the graph and $b_0(G)$ 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.