Symbolic powers of multipartite hypergraphs and Waldschmidt constant
A. Alilooee, A. Banerjee
TL;DR
This paper establishes criteria for the equality of symbolic and ordinary powers of edge ideals in 3-partite hypergraphs and provides a formula for the Waldschmidt constant of cycle path ideals.
Contribution
It introduces a criterion for symbolic and ordinary power equality in 3-partite hypergraphs and derives a formula for the Waldschmidt constant of cycle path ideals.
Findings
Criterion for second symbolic and ordinary powers equality in 3-partite hypergraphs
Formula for Waldschmidt constant of cycle path ideals
Insights into algebraic properties of hypergraph edge ideals
Abstract
In this paper, we find a criterion to answer when the second symbolic and ordinary powers of the edge ideal of a 3-partite hypergraph are equal. Also, we give the formula to compute the Waldschmidt constant of the path ideals of a cycle.
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
TopicsGraph theory and applications · Commutative Algebra and Its Applications · Tensor decomposition and applications