SearcharxivSearch

arXiv · 2404.18277

A Combinatorial Generalisation of Rank two Complex Reflection Groups via Generators and Relations

Abstract

Complex reflection groups of rank two are precisely the finite groups in the family of groups that we call J-reflection groups. These groups are particular cases of J-groups as defined by Achar & Aubert in 2008. The family of J-reflection groups generalises both complex reflection groups of rank two and toric reflection groups, a family of groups defined and studied by Gobet. We give uniform presentations by generators and relations of J-reflection groups, which coincide with the presentations given by Brou\'e, Malle and Rouquier when the groups are finite. In particular, these presentations provide uniform presentations for complex reflection groups of rank two where the generators are reflections (however the proof uses the classification of irreducible complex reflection groups). Moreover, we show that the center of J-reflection groups is cyclic, generalising what happens for irreducible complex reflection groups of rank two and toric reflection groups. Finally, we classify J-reflection groups up to reflection isomorphisms.

Explore related subjects

Keep this discovery

BibTeXRIS

Igor Haladjian. 2024-04-28. A Combinatorial Generalisation of Rank two Complex Reflection Groups via Generators and Relations. https://arxiv.org/abs/2404.18277

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR