Regularity of symbolic powers of certain graphs
Bidwan Chakraborty, Mousumi Mandal

TL;DR
This paper investigates the algebraic properties of a class of graphs called $G_{n,r}$, proving Minh's conjecture that the regularity of their edge ideal's powers are equal and computing key invariants like the Waldschmidt constant.
Contribution
The paper proves Minh's conjecture for the edge ideals of $G_{n,r}$ graphs and calculates their Waldschmidt constant and resurgence, expanding understanding of symbolic and ordinary powers.
Findings
Regularity of symbolic and ordinary powers are equal for $I(G_{n,r})$.
Computed Waldschmidt constant for the class of graphs.
Determined resurgence for the class of graphs.
Abstract
Let denote the graph with vertices in cyclic order and for each vertex consider the set where is the vertex , whenever and . In , every vertex is adjacent to all the vertices of . Let be the edge ideal of . We show that Minh's conjecture is true for i.e. regularity of ordinary powers and symbolic powers of are equal. We compute the Waldschmidt constant and resurgence for the whole class.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Graph theory and applications · Algebraic structures and combinatorial models
