Powers of generalized binomial edge ideals of path graphs
Yi-Huang Shen, Guangjun Zhu

TL;DR
This paper investigates algebraic properties of powers of generalized binomial edge ideals associated with path graphs, providing explicit formulas for regularity, depth limits, and algebraic structures like Rees algebras.
Contribution
It offers explicit computations of regularity, depth limits, and analyzes the Rees algebra and fiber ring of these ideals, advancing understanding of their algebraic behavior.
Findings
Explicit formulas for regularity of powers
Limit of depths of the ideals
Rees algebra and fiber ring structures analyzed
Abstract
In this article, we study the powers of the generalized binomial edge ideal of a path graph . We explicitly compute their regularities and determine the limit of their depths. We also show that these ordinary powers coincide with their symbolic powers. Additionally, we study the Rees algebra and the special fiber ring of via Sagbi basis theory. In particular, we obtain exact formulas for the regularity of these blowup algebras.
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 · Algebraic structures and combinatorial models · Polynomial and algebraic computation
