SearcharxivSearch

arXiv · 2112.10538

Redundant relators in cyclic presentations of groups

Abstract

A cyclic presentation of a group is a presentation with an equal number of generators and relators that admits a particular cyclic symmetry. We characterise the orientable, non-orientable, and redundant cyclic presentations and obtain concise refinements of these presentations. We show that the Tits alternative holds for the class of groups defined by redundant cyclic presentations and that if the number of generators of the cyclic presentation is greater than two then the corresponding group is large. Generalizing and extending earlier results of the authors we describe the star graphs of orientable and non-orientable cyclic presentations and classify the cyclic presentations whose star graph components are pairwise isomorphic incidence graphs of generalized polygons, thus classifying the so-called $(m,k,\nu)$-special cyclic presentations.

Explore related subjects

Keep this discovery

BibTeXRIS

Ihechukwu Chinyere, Gerald Williams. 2021-12-20. Redundant relators in cyclic presentations of groups. https://arxiv.org/abs/2112.10538

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