Preliminaries from Combinatorial Group Theory

  • Markus Lohrey
Chapter
First Online:
Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

Abstract

In this chapter, we recall basic definitions from combinatorial group theory. We assume some basic knowledge of group theory; see, for instance, [149]. More background on combinatorial group theory can be found in [119, 158]. Groups will be written multiplicatively throughout this work and the group identity will be denoted with 1.

This is a preview of subscription content, log in to check access.

References

  1. 10.
    J. Avenhaus, K. Madlener, Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. Archiv für Mathematische Logik und Grundlagenforschung 19(1–2), 3–12 (1978/79)Google Scholar
  2. 13.
    G. Baumslag, A non-cyclic one-relator group all of whose finite quotients are cyclic. J. Austr. Math. Soc. Ser. A. Pure Math. Stat. 10, 497–498 (1969)CrossRefMATHMathSciNetGoogle Scholar
  3. 19.
    J.-C. Birget, A.Y. Ol’shanskii, E. Rips, M.V. Sapir, Isoperimetric functions of groups and computational complexity of the word problem. Ann. Math. Sec. Ser. 156(2), 467–518 (2002)Google Scholar
  4. 20.
    A. Björner, F. Brenti, Combinatorics of Coxeter Groups. Graduate Texts in Mathematics, vol. 231 (Springer, New York, 2005)Google Scholar
  5. 22.
    W.W. Boone, The word problem. Ann. Math. Sec. Ser. 70, 207–265 (1959)CrossRefMATHMathSciNetGoogle Scholar
  6. 23.
    W.W. Boone, G. Higman, An algebraic characterization of groups with soluble word problem. J. Austr. Math. Soc. 18, 41–53 (1974)CrossRefMATHMathSciNetGoogle Scholar
  7. 24.
    B. Brink, R.B. Howlett, A finiteness property and an automatic structure for Coxeter groups. Math. Ann. 296, 179–190 (1993)CrossRefMATHMathSciNetGoogle Scholar
  8. 25.
    J.-Y. Cai, Parallel computation over hyperbolic groups. In Proceedings of the 24th Annual Symposium on Theory of Computing, STOC 1992 (ACM Press, New York, 1992), pp. 106–115Google Scholar
  9. 27.
    F.B. Cannonito, Hierarchies of computable groups and the word problem. J. Symbolic Logic 31, 376–392 (1966)CrossRefMATHMathSciNetGoogle Scholar
  10. 29.
    F.B. Cannonito, R.W. Gatterdam, The word problem and power problem in 1-relator groups are primitive recursive. Pacific J. Math. 61(2), 351–359 (1975)CrossRefMATHMathSciNetGoogle Scholar
  11. 30.
    W.A. Casselman, Automata to perform basic calculations in coxeter groups. C.M.S. Conference Proceedings, vol. 16, 1994Google Scholar
  12. 32.
    R. Charney, An introduction to right-angled artin groups. Geometriae Dedicata 125, 141–158 (2007)CrossRefMATHMathSciNetGoogle Scholar
  13. 38.
    D.E. Cohen, K. Madlener, F. Otto, Separating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups. Math. Logic Q. 39(2), 143–157 (1993)CrossRefMATHMathSciNetGoogle Scholar
  14. 49.
    V. Diekert, Combinatorics on Traces. Lecture Notes in Computer Science, vol. 454 (Springer, New York, 1990)Google Scholar
  15. 54.
    V. Diekert, J. Laun, A. Ushakov, Efficient algorithms for highly compressed data: the word problem in Higman’s group is in P. Int. J. Algebra Comput. 22(8), 19 p (2012)Google Scholar
  16. 57.
    D.B.A. Epstein, J.W. Cannon, D.F. Holt, S.V.F. Levy, M.S. Paterson, W.P. Thurston, Word Processing in Groups (Jones and Bartlett, Boston, 1992)MATHGoogle Scholar
  17. 61.
    S. M. Gersten, Dehn functions and ℓ 1-norms of finite presentations. In Algorithms and Classification in Combinatorial Group Theory, ed. by G. Baumslag, C.F. Miller III (Springer, New York, 1991), pp. 195–220Google Scholar
  18. 62.
    S.M. Gersten, D.F. Holt, T.R. Riley, Isoperimetric inequalities for nilpotent groups. Geom. Funct. Anal. 13(4), 795–814 (2003)CrossRefMATHMathSciNetGoogle Scholar
  19. 64.
    O. Goodman, M. Shapiro, On a generalization of Dehn’s algorithm. Int. J. Algebra Comput. 18(7), 1137–1177 (2008)CrossRefMATHMathSciNetGoogle Scholar
  20. 68.
    M. Gromov, Hyperbolic groups. In Essays in Group Theory, ed. by S.M. Gersten. MSRI Publ., vol. 8 (Springer, New York, 1987), pp. 75–263Google Scholar
  21. 75.
    S. Hermiller, J. Meier, Algorithms and geometry for graph products of groups. J. Algebra 171, 230–257 (1995)CrossRefMATHMathSciNetGoogle Scholar
  22. 77.
    G. Higman, Subgroups of finitely presented groups. Proc. Roy. Soc. Lond. Ser. A 262, 455–475 (1961)CrossRefMATHMathSciNetGoogle Scholar
  23. 81.
    D. Holt, Word-hyperbolic groups have real-time word problem. Int. J. Algebra Comput. 10, 221–228 (2000)CrossRefMATHMathSciNetGoogle Scholar
  24. 86.
    N. Jacobson, Lectures in Abstract Algebra, Vol III: Theory of Fields and Galois Theory (D. Van Nostrand Co. Inc., Princeton, 1964)CrossRefMATHGoogle Scholar
  25. 87.
    N. Jacobson, Basic Algebra I (W. H. Freeman and Company, New York, 1974)MATHGoogle Scholar
  26. 97.
    O. Kharlampovich, A. Myasnikov, M. Sapir, Algorithmically complex residually finite groups. Technical Report. arXiv.org (2012), http://arxiv.org/abs/1204.6506
  27. 108.
    R.J. Lipton, Y. Zalcstein, Word problems solvable in logspace. J. Assoc. Comput. Mach. 24(3), 522–526 (1977)CrossRefMATHMathSciNetGoogle Scholar
  28. 111.
    M. Lohrey, Decidability and complexity in automatic monoids. Int. J. Found. Comput. Sci. 16(4), 707–722 (2005)CrossRefMATHMathSciNetGoogle Scholar
  29. 119.
    R.C. Lyndon, P.E. Schupp, Combinatorial Group Theory (Springer, New York, 1977)MATHGoogle Scholar
  30. 121.
    W. Magnus, Das Identitätsproblem für gruppen mit einer definierenden relation. Math. Ann. 106(1), 295–307 (1932)CrossRefMathSciNetGoogle Scholar
  31. 126.
    J. McKinsey, The decision problem for some classes of sentences without quantifiers. J. Symbolic Logic 8, 61–76 (1973)CrossRefMathSciNetGoogle Scholar
  32. 131.
    A. Myasnikov, V. Shpilrain, A. Ushakov, in Non-commutative Cryptography and Complexity of Group-theoretic Problems. Mathematical Surveys and Monographs, vol. 177 (American Mathematical Society, Providence, 2011)Google Scholar
  33. 132.
    A.G. Myasnikov, A. Ushakov, D.W. Won, The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable. J. Algebra 345(1), 324–342 (2011)CrossRefMATHMathSciNetGoogle Scholar
  34. 133.
    A.G. Myasnikov, A. Ushakov, D.W. Won, Power circuits, exponential algebra, and time complexity. Int. J. Algebra Comput. 22(6), (2012)Google Scholar
  35. 136.
    P.S. Novikov, On the algorithmic unsolvability of the word problem in group theory. Amer. Math. Soc. Transl. II. Ser. 9, 1–122 (1958)MATHGoogle Scholar
  36. 143.
    A.N. Platonov, An isoparametric function of the Baumslag-Gersten group. Vestnik Moskov. Univ. Ser. I Mat. Mekh. 3, 12–17, 70 p (2004)Google Scholar
  37. 147.
    T. Riley, What is a Dehn function? In Office Hours with a Geometric Group Theorist, ed. by M. Clay, D. Margalit (Princeton University Press, Princeton, to appear)Google Scholar
  38. 149.
    J.J. Rotman, An Introduction to the Theory of Groups, 4th edn. (Springer, New York, 1995)CrossRefMATHGoogle Scholar
  39. 155.
    H.-U. Simon, Word problems for groups and contextfree recognition. In Proceedings of Fundamentals of Computation Theory, FCT 1979 (Akademie, Berlin, 1979), pp. 417–422Google Scholar
  40. 158.
    J. Stillwell, Classical Topology and Combinatorial Group Theory, 2nd edn. (Springer, New York, 1995)Google Scholar
  41. 160.
    H. Tietze, Über die topologischen Invarianten mehrdimensionaler Mannigfaltigkeiten. Monatsh. Math. Phys. 19(1), 1–118 (1908)CrossRefMathSciNetGoogle Scholar
  42. 164.
    B.A. Wehrfritz, On finitely generated soluble linear groups. Math. Z. 170, 155–167 (1980)CrossRefMATHMathSciNetGoogle Scholar
  43. 165.
    D.T. Wise, Research announcement: the structure of groups with a quasiconvex hierarchy. Electron. Res. Announc. Math. Sci. 16, 44–55 (2009)MATHMathSciNetGoogle Scholar
  44. 166.
    C. Wrathall, The word problem for free partially commutative groups. J. Symbolic Comput. 6(1), 99–104 (1988)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Markus Lohrey 2014

Authors and Affiliations

  • Markus Lohrey
    • 1
  1. 1.Department for Electrical Engineering and Computer ScienceUniversity of SiegenSiegenGermany

Personalised recommendations