On powers of the cover ideals of graphs
Dancheng Lu, Zexin Wang

TL;DR
This paper investigates algebraic properties of powers of cover ideals in graphs, proving equalities for symbolic and ordinary powers in odd cycles, and exploring conditions for vertex decomposability and polymatroidality.
Contribution
It establishes the equality of symbolic and ordinary powers of cover ideals for odd cycles and links weak polymatroidality to vertex decomposability and clique-whiskered graphs.
Findings
$(J(C)^{(s)}) = (J(C)^s)$ for all $s \\geq 1$ and odd cycles
Vertex decomposability linked to weak polymatroidality of dual ideals
Powers of cover ideals in clique-whiskered graphs are weakly polymatroidal
Abstract
For a simple graph , assume that is the vertex cover ideal of and is the -th symbolic power of . We prove that for all and for all odd cycle . For a simplicial complex , we show that is vertex decomposable if is weakly polymatroidal. Let be a fully clique-whiskering graph, we prove that is weakly polymatroidal for all .
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 · Topological and Geometric Data Analysis · Algebraic Geometry and Number Theory
