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

Publication date 10 December 2012

Generators, relations, and presentations of groups (20F05) Cancellation theory of groups; application of van Kampen diagrams (20F06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

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.

This page was built for publication: Dehn Functions, the Word Problem, and the Bounded Word Problem For Decidable Group Presentations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6237883)