SearcharxivSearch

arXiv · 2305.11838

On the Andrews-Curtis groups: non-finite presentability

Abstract

The Andrews-Curtis conjecture remains one of the outstanding open problems in combinatorial group theory. It claims that every normally generating $r$-tuple of a free group $F_r$ of rank $r\geq 2$ can be reduced to a basis by means of Nielsen transformations and arbitrary conjugations. These transformations generate the so-called Andrews-Curtis group AC($F_r$). The groups AC($F_r$) ($r = 2, 3, \ldots$) are actively investigated and allows various generalizations, for which there are a number of results. At the same time, almost nothing is known about the structure and properties of the original groups AC($F_r$). In this paper we define a class $\{A_{r, s}: r, s \geq 1\}$ of generalized Andrews-Curtis groups in which any group $A_{r,r}$ is isomorphic to the Andrews-Curtis group AC($F_r$). We prove that every group $A_{2,s}$\, ($s \geq 1$) is non-finitely presented. Hence the Andrews-Curtis group AC($F_2$) $\simeq A_{2,2}$ is non-finitely presented. Thus, we give a partial answer to the well-known question about the finite presentability of the groups AC($F_r$), explicitly stated by J. Swan and A. Lisitsa in the Kourovka notebook \cite{KN} (Question 18.89).

Explore related subjects

Keep this discovery

BibTeXRIS

Vitaly Roman'kov. 2023-05-19. On the Andrews-Curtis groups: non-finite presentability. https://arxiv.org/abs/2305.11838

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