Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1212.2024

Dehn Functions, the Word Problem, and the Bounded Word Problem For Decidable Group Presentations

Desmond Cummins
View original source ↗Read source document ↗Export metadata ↓

Abstract

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that no finitely generated decidable presentations exist satisfying the combinations for which we do not provide examples. The presentations we construct are also minimal. These constructions answer an open question asked by R.I. Grigorchuk and S.V. Ivanov. Our approach uses machinery developed by Birget, Ol'shanskii, Rips, and Sapir for constructing finite group presentations that simulate Turing machines. We generalize this machinery to construct finitely generated decidable group presentations that simulate computing objects similar to oracle Turing machines.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Desmond Cummins. 2013-01-15. Dehn Functions, the Word Problem, and the Bounded Word Problem For Decidable Group Presentations. https://arxiv.org/abs/1212.2024

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↗