On The Generalized Binomial Edge Ideals of Generalized Block Graphs
Faryal Chaudhry, Rida Irfan
TL;DR
This paper investigates the algebraic properties of generalized binomial edge ideals linked to generalized block graphs, focusing on their depth and regularity bounds, contributing to the understanding of their algebraic structure.
Contribution
It provides explicit calculations and bounds for the depth and regularity of these ideals, extending previous work to a broader class of graphs.
Findings
Computed the depth of generalized binomial edge ideals.
Provided bounds for the regularity of these ideals.
Extended algebraic understanding of generalized block graphs.
Abstract
We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.
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 · Polynomial and algebraic computation · Algebraic Geometry and Number Theory