Mathematics > Commutative Algebra
[Submitted on 28 May 2018]
Title:Regularity of the vanishing ideal over a bipartite nested ear decomposition
View PDFAbstract: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.
Current browse context:
math.AC
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.