WorksMathematics
Trickle groups on a complete graph are linear
Abstract
Trickle groups were recently introduced by Bellingeri, Godelle and Paris, as generalizations of both cactus groups and right-angled Coxeter and Artin groups. We construct a representation of any trickle group with complete graph on a space having a basis in bijection with the vertex set , and show that it is faithful. This in particular shows that trickle Garside groups are linear. It also allows one to realize every finite trickle group as a subgroup of . We do not use the results of Bellingeri, Godelle and Paris; instead we rather show that several properties of trickle groups that they obtained (and also some new ones) can easily be proven in the particular case of a complete graph using our representation. This includes the normal forms, the embedding of the trickle monoid inside the group in the case where for all , and the absence of torsion of the latter. In this last case we give a second proof of faithfulness in the spirit of Krammer-Hée, which explains how to read Garside-theoretic information from the representation.