On distance two in Cayley graphs of Coxeter groups
Abstract
We consider the Cayley graph C(W,S) of a Coxeter system (W,S) and describe all maximal 2-cliques in this graph, i.e. maximal subsets in the vertex set such that the distance between any two distinct elements is equal to 2. As an application, we show that every automorphism of the half of Cayley graph is uniquely extendable to an automorphism of the Cayley graph if |S| 5.
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.