SearcharxivSearch

arXiv · 2208.08560

The Adian-Rabin Theorem -- An English translation

Abstract

This is an English translation of four remarkable articles, originally written in Russian, by Sergei Ivanovich Adian (1931--2020), supplemented by the translation of two closely related articles by Andrei Andreevich Markov Jr (1903--1979). All six articles concern algorithmic undecidability of various problems for groups and monoids. The articles by S. I. Adian give his proof of the famous "Adian-Rabin Theorem", which shows that there is no algorithm which takes as input a finite presentation of a group together with a "Markov" property $P$ (e.g. being the trivial group, being infinite, etc.), and which outputs whether or not the presented group has property $P$. The articles by A. A. Markov (Jr) give the analogous result for monoids (a significantly easier result), and appeared several years before the group-theoretic analogue. A preface detailing the contents of the articles and some commentary is provided, including the somewhat difficult task of deciding which of Adian's four articles should be considered as containing "the" proof of the Adian-Rabin theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Carl-Fredrik Nyberg-Brodda. 2022-08-17. The Adian-Rabin Theorem -- An English translation. https://arxiv.org/abs/2208.08560

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