Regularity of the vanishing ideal over a bipartite nested ear decomposition

TL;DR

This paper investigates the Castelnuovo-Mumford regularity of the vanishing ideal over bipartite graphs with specific decompositions, providing formulas that relate the regularity to graph structure and field characteristics.

Contribution

It establishes a formula for the regularity of the vanishing ideal over bipartite graphs with weak nested ear decompositions, linking it to graph structure and field size.

Findings

Regularity increases by  rac{\u221e}{2} f (q-2) when attaching a path of length  rac{\u221e}{2} f.

Regularity of bipartite graphs with weak nested ear decomposition is  rac{|V_G|+ \u03b5-3}{2}(q-2).

Number of even length ears in such decompositions is constant.

Abstract

We study the Castelnuovo-Mumford regularity of the vanishing ideal over a bipartite graph endowed with a decomposition of its edge set. We prove that, under certain conditions, the regularity of the vanishing ideal over a bipartite graph obtained from a graph by attaching a path of length $\ell$ increases by $\lfloor \frac{\ell}{2}\rfloor (q-2)$, where $q$ is the order of the field of coefficients. We use this result to show that the regularity of the vanishing ideal over a bipartite graph, $G$, endowed with a weak nested ear decomposition is equal to $$\textstyle \frac{|V_G|+ \epsilon -3}{2}(q-2),$$ where $\epsilon$ is the number of even length ears and pendant edges of the decomposition. As a corollary, we show that for bipartite graph, the number of even length ears in a nested ear decomposition starting from a vertex is constant.