2000 character limit reached
On stacked triangulated manifolds
Published 25 Jul 2014 in math.GT and math.CO | (1407.6767v3)
Abstract: We prove two results on stacked triangulated manifolds in this paper: (a) every stacked triangulation of a connected manifold with or without boundary is obtained from a simplex or the boundary of a simplex by certain combinatorial operations; (b) in dimension $d \geq 4$, if $\Delta$ is a tight connected closed homology $d$-manifold whose $i$th homology vanishes for $1 < i < d-1$, then $\Delta$ is a stacked triangulation of a manifold.These results give affirmative answers to questions posed by Novik and Swartz and by Effenberger.
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.