Ackermannian integer compression and the word problem for hydra groups

DOI10.4230/LIPICS.MFCS.2016.30MaRDI QIDQ4608589zbMATH OpenOpenAlexFDO

Authors Will Dison, Eduard Einstein, Timothy Riley

Publication date 21 March 2018

Full work available at URL https://dblp.uni-trier.de/db/conf/mfcs/mfcs2016.html#DisonER16

zbMATH Keywords

Ackermann functionshydraword problem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Geometric group theory (20F65)

Recommendations

• Taming the hydra: the word problem and extreme integer compression
• Efficient algorithms for highly compressed data: the word problem in Higman's group is in P
• Efficient algorithms for highly compressed data: the word problem in Higman's group is in P.
• Hydra group doubles are not residually finite.
• Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P

Cited in

(7)

• Hydra group doubles are not residually finite.
• Hydra groups.
• Taming the hydra: the word problem and extreme integer compression
• Compressed decision problems in hyperbolic groups
• The Compressed Word Problem for Groups
• Some considerations on Hydra groups and a new bound for the length of words
• Compressed decision problems in hyperbolic groups

This page was built for publication: Ackermannian integer compression and the word problem for hydra groups

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