SearcharxivSearch

arXiv · 1705.09651

Small cancellation theory over Burnside groups

Abstract

We develop a version of small cancellation theory in the variety of Burnside groups. More precisely, we show that there exists a critical exponent $n_0$ such that for every odd integer $n\geq n_0$, the well-known classical $C'(1/6)$-small cancellation theory, as well as its graphical generalization and its version for free products, produce examples of infinite $n$-periodic groups. Our result gives a powerful tool for producing (uncountable collections of) examples of $n$-periodic groups with prescribed properties. It can be applied without any prior knowledge in the subject of $n$-periodic groups. As applications, we show the undecidability of Markov properties in classes of $n$-periodic groups, we produce $n$-periodic groups whose Cayley graph contains an embedded expander graphs, and we give an $n$-periodic version of the Rips construction. We also obtain simpler proofs of some known results like the existence of uncountably many finitely generated $n$-periodic groups and the SQ-universality (in the class of $n$-periodic groups) of free Burnside groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Rémi Coulon, Dominik Gruber. 2017-05-26. Small cancellation theory over Burnside groups. https://doi.org/10.1016/j.aim.2019.05.029

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