DROPS

Document

DOI: 10.4230/LIPIcs.MFCS.2016.30

Ackermannian Integer Compression and the Word Problem for Hydra Groups

Authors: Will Dison, Eduard Einstein, and Timothy R. Riley

Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)

Abstract

For a finitely presented group, the word problem asks for an algorithm which declares whether or not words on the generators represent the identity. The Dehn function is a complexity measure of a direct attack on the word problem by applying the defining relations. Dison and Riley showed that a "hydra phenomenon" gives rise to novel groups with extremely fast growing (Ackermannian) Dehn functions. Here we show that nevertheless, there are efficient (polynomial time) solutions to the word problems of these groups. Our main innovation is a means of computing efficiently with enormous integers which are represented in compressed forms by strings of Ackermann functions.

Cite as

Will Dison, Eduard Einstein, and Timothy R. Riley. Ackermannian Integer Compression and the Word Problem for Hydra Groups. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 30:1-30:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{dison_et_al:LIPIcs.MFCS.2016.30,
  author =	{Dison, Will and Einstein, Eduard and Riley, Timothy R.},
  title =	{{Ackermannian Integer Compression and the Word Problem for Hydra Groups}},
  booktitle =	{41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
  pages =	{30:1--30:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-016-3},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{58},
  editor =	{Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.30},
  URN =		{urn:nbn:de:0030-drops-64458},
  doi =		{10.4230/LIPIcs.MFCS.2016.30},
  annote =	{Keywords: Ackermann functions, hydra, word problem}
}

Search Results

Documents authored by Dison, Will

Ackermannian Integer Compression and the Word Problem for Hydra Groups

Abstract

Cite as

Thanks for your feedback!

Could not send message