Combinatorial local convexity implies convexity in finite dimensional CAT(0) cubed complexes
Abstract
We give a proof to the following theorem, which is well-known among experts: A connected subcomplex W of a finite dimensional CAT(0) cubed complex X is convex if and only if Lk(v, W) is a full subcomplex of Lk(v, X) for every vertex v of W.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.