On the non-discreteness of automorphism groups of Cayley graphs of Coxeter groups

Abstract

In this work we characterise Cayley graphs of Coxeter groups with respect to the standard generating set that admit uncountable vertex stabilisers. As a corollary, we fully identify finitely generated Coxeter groups for which the automorphism group of their Cayley graph with respect to the standard generating set is not discrete when equipped with the permutation topology. As an application, we also provide new explicit constructions of vertex-transitive graphs of infinite degree that have locally compact automorphism groups. Contents 18 5. Beyond locally finite graphs 23 References 25 c 1 ) m(x, y) = m(y, x) for all x, y ∈ V Γ; c 2 ) m(x, y) = 1 if and only if x = y;