SearcharxivSearch

arXiv · 2109.11463

Cyclically presented groups as Labelled Oriented Graph groups

Abstract

We use results concerning the Smith forms of circulant matrices to identify when cyclically presented groups have free abelianisation and so can be Labelled Oriented Graph (LOG) groups. We generalize a theorem of Odoni and Cremona to show that for a fixed defining word, whose corresponding representer polynomial has an irreducible factor that is not cyclotomic and not equal to $\pm t$, there are at most finitely many $n$ for which the corresponding $n$-generator cyclically presented group has free abelianisation. We classify when Campbell and Robertson's generalized Fibonacci groups $H(r,n,s)$ are LOG groups and when the Sieradski groups are LOG groups. We prove that amongst Johnson and Mawdesley's groups of Fibonacci type, the only ones that can be LOG groups are Gilbert-Howie groups $H(n,m)$. We conjecture that if a Gilbert-Howie group is a LOG group, then it is a Sieradski group, and prove this in certain cases (in particular, for fixed $m$, the conjecture can only be false for finitely many $n$). We obtain necessary conditions for a cyclically presented group to be a connected LOG group in terms of the representer polynomial and apply them to the Prishchepov groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Vanni Noferini, Gerald Williams. 2021-09-23. Cyclically presented groups as Labelled Oriented Graph groups. https://arxiv.org/abs/2109.11463

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