Diagram groups

Memoirs of the American Mathematical Society

Volumn , Issue 620, 1997, Pages 1-116

  Guba, Victor ^a   Sapir, Mark ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031281587     PISSN: 00659266     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (41)

1. [1] S. I. Adian. Word transformations in a semigroup that is given by a system of defining relations. Algebra i Logika, 15:611-621, 1976. English translation in Algebra and Logic 15 (1976).
2. [1] S. I. Adian. Word transformations in a semigroup that is given by a system of defining relations. Algebra i Logika, 15:611-621, 1976. English translation in Algebra and Logic 15 (1976).
3. [2] G. Baumslag, C. F. Miller III, and H. Short. Isoperimetric inequalities and the homology of groups. Invent. Math., 113:531-560, 1993.
4. [3] W. A. Bogley. Retractive maps and local collapsibility. PhD thesis, Univ. of Oregon, 1987.
5. [4] R. V. Book and F. Otto. String-rewriting systems. Springer-Verlag, New York, 1993.
6. [5] M. G. Brin and C. C. Squier. Groups of piecewise linear homeomorphisms of the real line. Invent. Math., 79:485-498, 1985.
7. [6] K. S. Brown. Finiteness properties of groups. J. of Pure and Applied Algebra, 44:45-75, 1987.
8. [7] J. W. Cannon, W. J. Floyd, and W. R. Parry. Notes on Richard Thompson's groups F and T. Technical Report GCG63, Geometry Center. University of Minnesota, January, 1994.
9. [8] I.M. Chiswell, D. J. Collins and J. Huebshmann, Aspherical group presentations, Math. Z., 178 (1981), 1-36.
10. [9] N. Dershowitz and J-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 6, pages 244-320, Elsevier Science Publishers B.V., 1990.
11. [10] L. Fuchs. Partially ordered algebraic systems. Pergamon Press, 1963.
12. [11] M. R. Garey and D. S. Johnson. Computers and intractibility. A guide to the theory of NP-completeness. W. H. Freeman and Co., San Francisco, 1979.
13. [12] J. R. J. Groves. Rewriting systems and homology of groups. In L. G. Kovacs, editor, Groups (Canberra 1989), pages 114-141, Springer-Verlag, 1991.
14. [13] P. M. Higgins. Techniques of Semigroup Theory. Oxford University Press, New York, 1992.
15. [14] G. Higman. Finitely presented infinite simple groups. Notes Pure Math., 8, Austral. Nat. Univ., Canberra, 1974.
16. [15] J. Howie. On the asphericity of ribbon disc complements. Trans. Amer. Math. Soc., 289:281-302, 1985.
17. [16] E. V. Kashintsev. Graphs and the word problems for finitely presented semigroups. Uch. Zap. Tul. Ped. Inst., 2:290-302, 1970. (In Russian).
18. [17] V. Kilibarda. On the algebra of semigroup diagrams. PhD thesis, Univ. of Nebraska, 1994.
19. [18] P. G. Kontorovich. Gruppy s bazisom rassheplenija III. Mat. Sb., 22:79-100, 1948. (in Russian).
20. [19] P. G. Kontorovich. Gruppy s bazisom rassheplenija IV. Mat. Sb., 26:311-320, 1950. (in Russian).
21. n. Izv. Akad. Nauk. SSSR. Ser. Mat., 55(2):407-428, 1991. Translation: Mathematics-of-the-USSR-Izvestiya, 38 (1992), no. 2, 399-418.
22. n. Izv. Akad. Nauk. SSSR. Ser. Mat., 55(2):407-428, 1991. Translation: Mathematics-of-the-USSR-Izvestiya, 38 (1992), no. 2, 399-418.
23. [21] M. Lothaire. Combinatorics on Words. Volume 17 of Encyclopedia of Mathematics and its Applications, Addison-Wesley, 1983.
24. [22] R. C. Lyndon and P. E. Schupp. Combinatorial group theory. Springer-Verlag, 1977.
25. [23] G. S. Makanin. Equations in a free group. Izv. Akad. Nauk. SSSR. Ser. Mat., 46:1199-1273, 1982. transl. in Math. USSR Izv., V. 21, 1983.
26. [23] G. S. Makanin. Equations in a free group. Izv. Akad. Nauk. SSSR. Ser. Mat., 46:1199-1273, 1982. transl. in Math. USSR Izv., V. 21, 1983.
27. [24] R. McKenzie and R. J. Thompson. An elementary construction of unsolvable word problem in group theory. In W. W. Boon, F. B. Cannonito, and R. C. Lyndon, editors, Word Problems, pages 457-478, North-Holland, Publ. Corp., Amsterdam, London, 1973.
28. [25] M. H. A. Newman. On theories with a combinatorial definition of equivalence. Ann. Math., 43:223-243, 1942.
29. [26] A. Yu. Ol'shanskii. The geometry of defining relations in groups. Nauka, Moscow, 1989.
30. [27] S. J. Pride. Geometric methods in combinatorial group theory. In J. Fountain, editor, Proc. of Int. Conf. on Groups, Semigroups and Formal Languages, York 1993, Kluwer Publishers, 1995, 215-232.
31. [28] S. J. Pride. Low-dimensional homotopy theory for monoids. Inter. J. Algebra Comput., 5(6), 1995, 631-649.
32. [29] J. H. Remmers. On the geometry of semigroup presentations. Advances in Math., 36(3):283-296, 1980.
33. [30] C. P. Rourke. Presentations of the trivial groups. In R. Fenn, editor, Topology of Low Dimensional Manifolds, pages 134-143, Springer-Verlag, 1979.
34. [31] H. Short. Topological Methods in Group Theory: The Adjunction Problem. PhD thesis, Univ. of Warwick, 1981.
35. [32] C. C. Squier. A finiteness condition for rewriting systems, revision by F. Otto and Y. Kobayashi. Theoret. Comput. Sci., 131:271-294, 1994.
36. [33] C. C. Squier. Word problems and a homological finiteness condition for monoids. J. of Pure and Applied Algebra, 49:201-217, 1987.
37. [34] J. Stallings. A graph-theoretic lemma and group embeddings. Ann. Math., 111:145-155, 1987.
38. [35] J. Stillwell. Classical topology and combinatorial group theory. Springer-Verlag, 1980.
39. [36] G. S. Tseitin. Associative system with unsolvable word problem. Dokl. Akad. Nauk. SSSR, 107:370-371, 1956. The complete proof see in Trudy Mat. Inst. Steklov 52 (1958), 172-189.
40. [36] G. S. Tseitin. Associative system with unsolvable word problem. Dokl. Akad. Nauk. SSSR, 107:370-371, 1956. The complete proof see in Trudy Mat. Inst. Steklov 52 (1958), 172-189.
41. 4. Osaka J. of Math., 6:435-446, 1969.