2000 character limit reached
Spherical complexes
Published 13 Nov 2023 in math.AC, math.AT, and math.CO | (2311.07727v2)
Abstract: In this paper we define spherical complexes as simplicial complexes with the property that every subcomplex obtained by a sequence of links and deletions either has trivial homology, or has the homology of a sphere. Examples of such complexes are independence complexes of ternary graphs and independence complexes of simplicial forests. We give criteria for when a spherical complex is acyclic, and describe the dimension of the sphere when it is not. We then apply our results to compute the Leray number of these complexes, and define combinatorial invariants for them which are counterparts to algebraic invariants of their Stanley-Reisner rings.
Paper Prompts
Sign up for free to create and run prompts on this paper.