2000 character limit reached
Polyhedral CAT(0) metrics on locally finite complexes
Published 23 Apr 2024 in math.GT and math.CO | (2404.14878v1)
Abstract: We prove the arborescence of any locally finite complex that is $CAT(0)$ with a polyhedral metric for which all vertex stars are convex. In particular locally finite $CAT(0)$ cube complexes or equilateral simplicial complexes are arborescent. Moreover, a triangulated manifold admits a $CAT(0)$ polyhedral metric if and only if it admits arborescent triangulations. We prove eventually that every locally finite complex which is $CAT(0)$ with a polyhedral metric has a barycentric subdivision which is arborescent.
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.