betaFeedback

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 Tr(Γ)\mathrm{Tr}(Γ) with complete graph ΓΓ on a space having a basis in bijection with the vertex set V(Γ)V(Γ), 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 GL∣V(Γ)∣(C)\mathrm{GL}_{|V(Γ)|}(\mathbb{C}). 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 μ(x)=∞μ(x)=\infty for all x∈V(Γ)x\in V(Γ), 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.

Paper details

vlnc:W_7mpug33d
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 9

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…