Regularity of the vanishing ideal over a bipartite nested ear decomposition
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 increases by 2 (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 |VG|+ ε -32(q-2), where ε 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.