On embeddings of CAT(0) cube complexes into products of trees
Abstract
We prove that the contact graph of a 2-dimensional CAT(0) cube complex X of maximum degree can be coloured with at most ε()=M26 colours, for a fixed constant M. This implies that X (and the associated median graph) isometrically embeds in the Cartesian product of at most ε() trees, and that the event structure whose domain is X admits a nice labeling with ε() labels. On the other hand, we present an example of a 5-dimensional CAT(0) cube complex with uniformly bounded degrees of 0-cubes which cannot be embedded into a Cartesian product of a finite number of trees. This answers in the negative a question raised independently by F. Haglund, G. Niblo, M. Sageev, and the first author of this paper.
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.