Conjugacy search problem and the Andrews-Curtis conjecture

Dmitry Panteleev; Alexander Ushakov

Home/Archive/arXiv

arXiv · 1609.00325

Conjugacy search problem and the Andrews-Curtis conjecture

Dmitry Panteleev·Alexander Ushakov

View original source ↗Read source document ↗Export metadata ↓

Abstract

We develop new computational methods for studying potential counterexamples to the Andrews-Curtis conjecture, in particular, Akbulut-Kurby examples AK(n). We devise a number of algorithms in an attempt to disprove the most interesting counterexample AK(3). To improve metric properties of the search space (which is a set of balanced presentations of the trivial group) we introduce a new transformation (called an ACM-move here) that generalizes the original Andrews-Curtis transformations and discuss details of a practical implementation. To reduce growth of the search space we introduce a strong equivalence relation on balanced presentations and study the space modulo automorphisms of the underlying free group. Finally, we prove that automorphism-moves can be applied to AK(n)-presentations. Unfortunately, despite a lot of effort we were unable to trivialize any of AK(n)-presentations, for n>2.

Explore related subjects

math.GR

Keep this discovery

BibTeX RIS

Dmitry Panteleev, Alexander Ushakov. 2016-09-01. Conjugacy search problem and the Andrews-Curtis conjecture. https://arxiv.org/abs/1609.00325

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗