Theory of Computing Systems

, Volume 55, Issue 4, pp 742–770 | Cite as

Efficient Algorithms for Highly Compressed Data: The Word Problem in Generalized Higman Groups Is in P

Article
  • 99 Downloads

Abstract

This paper continues the 2012 STACS contribution by Diekert, Ushakov, and the author as well as the 2012 IJAC publication by the same authors. We extend the results published there in two ways.

First, we show that the data structure of power circuits can be generalized to work with arbitrary bases q≥2. This results in a data structure that can hold huge integers, arising by iteratively forming powers of q. We show that the properties of power circuits known for q=2 translate to the general case. This generalization is non-trivial and additional techniques are required to preserve the time bounds of arithmetic operations that were shown for the case q=2.

The extended power circuit model permits us to conduct operations in the Baumslag-Solitar group BS(1,q) as efficiently as in BS(1,2). This allows us to solve the word problem in the generalization H 4(1,q) of Higman’s group in polynomial time. The group H 4(1,q) is an amalgamated product of four copies of the Baumslag-Solitar group BS(1,q) rather than BS(1,2) in the original group H 4=H 4(1,2).

As a second result, we allow arbitrary numbers f≥4 of copies of BS(1,q), leading to an even more generalized notion of Higman groups H f (1,q). We prove that the word problem of the latter can still be solved within the \({\mathcal {O}}(n^{6})\) time bound that was shown for H 4(1,2).

Keywords

Data structures Compression Algorithmic group theory Word problem 

Notes

Acknowledgements

The author gratefully acknowledges the helpful comments and suggestions by the anonymous reviewers.

References

  1. 1.
    Allcock, D.: Triangles of baumslag-solitar groups. Can. J. Math. 64(2), 241–253 (2012) MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Book, R.V., Otto, F.: String-Rewriting Systems. Springer, Berlin (1993) CrossRefMATHGoogle Scholar
  3. 3.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009) MATHGoogle Scholar
  4. 4.
    Diekert, V., Laun, J., Ushakov, A.: Efficient algorithms for highly compressed data: the word problem in Higman’s group is in P. In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), vol. 14, pp. 218–229 (2012) Google Scholar
  5. 5.
    Diekert, V., Laun, J., Ushakov, A.: Efficient algorithms for highly compressed data: the word problem in Higman’s group is in P. Int. J. Algebra Comput. 22(8) (2012) Google Scholar
  6. 6.
    Higman, G.: A finitely generated infinite simple group. J. Lond. Math. Soc. 26, 61–64 (1951) MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Lyndon, R., Schupp, P.: Combinatorial Group Theory. Classics in Mathematics. Springer, Berlin (2001) MATHGoogle Scholar
  8. 8.
    Laun, J.: Solving Algorithmic Problems in Baumslag-Solitar Groups and their Extensions Using Data Compression. PhD thesis, Universität Stuttgart (2012) Google Scholar
  9. 9.
    Myasnikov, A.G., Ushakov, A.: Cryptography And Groups (CRAG) Software Library Google Scholar
  10. 10.
    Myasnikov, A.G., Ushakov, A., Won, D.W.: The word problem in the baumslag group with a non-elementary Dehn function is polynomial time decidable. J. Algebra 345(1), 324–342 (2011) MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Myasnikov, A.G., Ushakov, A., Won, D.W.: Power circuits, exponential algebra, and time complexity. Int. J. Algebra Comput. 22(6) (2012) Google Scholar
  12. 12.
    Neumann, B.H.: An essay on free products of groups with amalgamations. Philos. Trans. R. Soc. Lond. Ser. A, Math. Phys. Sci. 246(919), 503–554 (1954) CrossRefMATHGoogle Scholar
  13. 13.
    Serre, J.-P.: Trees, 2nd corr. printing edn. Springer, Berlin (2002) Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Institut für Formale Methoden der InformatikUniversität StuttgartStuttgartGermany

Personalised recommendations