2000 character limit reached
Asymptotic depth of invariant chains of edge ideals
Published 10 Sep 2024 in math.AC and math.CO | (2409.06252v1)
Abstract: We completely determine the asymptotic depth, equivalently, the asymptotic projective dimension of a chain of edge ideals that is invariant under the action of the monoid Inc of increasing functions on the positive integers. Our results and their proofs also reveal surprising combinatorial and topological properties of corresponding graphs and their independence complexes. In particular, we are able to determine the asymptotic behavior of all reduced homology groups of these independence complexes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.