Generic-case complexity, decision problems in group theory, and random walks

Journal of Algebra

Volumn 264, Issue 2, 2003, Pages 665-694

  Kapovich, Ilya ^a   Myasnikov, Alexei ^b   Schupp, Paul ^a   Shpilrain, Vladimir ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b CITY COLLEGE OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037673298     PISSN: 00218693     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0021-8693(03)00167-4     Document Type: Article

References (65)

1. S.I. Adian, V.G. Durnev, Algorithmic problems for groups and semigroups, Uspekhi Mat. Nauk 55 (2) (2000) 3-94; translation in Russian Math. Surveys 55 (2) (2000) 207-296.
2. J. Alonso, T. Brady, D. Cooper, V. Ferlini, M. Lustig, M. Mihalik, M. Shapiro, H. Short, Notes on hyperbolic groups, in: E. Ghys, A. Haefliger, A. Verjovsky (Eds.), Group Theory from a Geometrical Viewpoint, Proceedings of the Workshop Held in Trieste, World Scientific, Singapore, 1991.
3. I. Anshel, M. Anshel, D. Goldfeld, An algebraic method for public-key cryptography, Math. Res. Lett. 6 (1999) 287-291.
4. M. Anshel, B. Domanski, The complexity of Dehn's algorithm for word problems in groups, J. Algorithms 6 (1985) 543-549.
5. K. Appel, P. Schupp, Artin groups and infinite Coxeter groups, Invent. Math. 72 (1983) 201-220.
6. G. Arzhantseva, A. Ol'shanskii, Genericity of the class of groups in which subgroups with a lesser number of generators are free, Mat. Zametki 59 (4) (1996) 489-496 (in Russian).
7. G. Arzhantseva, On groups in which subgroups with a fixed number of generators are free, Fundam. Prikl. Mat. 3 (3) (1997) 675-683 (in Russian).
8. G. Arzhantseva, Generic properties of finitely presented groups and Howson's theorem, Comm. Algebra 26 (1998) 3783-3792.
9. G. Arzhantseva, A property of subgroups of infinite index in a free group, Proc. Amer. Math. Soc. 128 (2000) 3205-3210.
10. L. Bartholdi, Counting paths in graphs, Enseign. Math. (2) 45 (1999) 83-131.
11. B. Baumslag, S.J. Pride, Groups with two more generators than relators, J. London Math. Soc. (2) 17 (3) (1978) 425-426.
12. G. Baumslag, S.M. Gersten, M. Shapiro, H. Short, Automatic groups and amalgams, J. Pure Appl. Algebra 76 (1991) 229-316.
13. G. Baumslag, C.F. Miller, Experimenting and computing with infinite groups, in: Groups and Computation II, New Brunswick, NJ, 1995, in: DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Vol. 28, American Mathematical Society, Providence, RI. 1997, pp. 19-30.
14. J.S. Birman, Braids, Links and Mapping Class Groups, Ann. of Math. Stud., Princeton Univ. Press, Princeton, NJ, 1974.
15. J.S. Birman, K.H. Ko, J.S. Lee, A new approach to the word and conjugacy problems in the braid groups, Adv. Math. 139 (1998) 322-353.
16. A. Borovik, A.G. Myasnikov, V. Remeslennikov, Multiplicative measures on free groups, Internat. J. Algebra Comput., to appear.
17. A. Borovik, A.G. Myasnikov, V. Shpilrain, Measuring sets in infinite groups, in: Computational and Statistical Group Theory, Las Vegas, NV/Hoboken, NJ, 2001, in: Contemp. Math., Vol. 298, American Mathematical Society, Providence, RI. 2002, pp. 21-42.
18. T. Ceccherini-Silberstein, R. Grigorchuck, P. de la Harpe, Amenability and paradoxical decompositions for pseudogroups and discrete metric spaces, Algebra Topol. Differ. Uravn. i ikh Prilozh. Trudy Mat. Inst. Steklova 224 (1999) 68-111; in Russian translation: Proc, Steklov Inst. Math. 224 (1) (1999) 57-97.
19. C. Champetier, Petite simplification dans les groupes hyperboliques, Ann. Fac. Sci. Toulouse Math. (6) 3 (2) (1994) 161-221.
20. C. Champetier, Propriétés statistiques des groupes de présentation finie, Adv. Math. 116 (1995) 197-262.
21. C. Champetier, The space of finitely generated groups, Topology 39 (2000) 657-680.
22. P.-A. Cherix, A. Valette, On spectra of simple random walks on one-relator groups, With an appendix by Paul Jolissaint, Pacific J. Math. 175 (1996) 417-438.
23. P.-A. Cherix, G. Schaeffer, An asymptotic Freiheitssatz for finitely generated groups, Enseign. Math. (2) 44 (1998) 9-22.
24. J.M. Cohen, Cogrowth and amenability of discrete groups, J. Funct. Anal. 48 (1982) 301-309.
25. M. Coornaert, T. Delzant, A. Papadopoulos, Geometric et Théorie des Groupes, Les Groupes Hyperboliques de Gromov, in: Lecture Notes in Math., Vol. 1441, Springer, Berlin, 1990.
26. P. Dehornoy, A fast method for comparing braids, Adv. Math. 125 (1997) 200-235.
27. D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson, W. Thurston, Word Processing in Groups, Jones and Bartlett, Boston, 1992.
28. B. Farb, Automatic groups: A guided tour, Enseign. Math. (2) 38 (1992) 291-313.
29. R. Foord, PhD Thesis, Warwick University, 2000.
30. S. Gersten, Introduction to hyperbolic and automatic groups, in: Summer School in Group Theory, Banff, 1996, in: CRM Proc. Lecture Notes, Vol. 17, American Mathematical Society, Providence, RI. 1999, pp. 45-70.
31. S. Gersten, H. Short, Rational subgroups of bi-automatic groups, Ann. of Math. (2) 134 (1991) 125-158.
32. E. Ghys, P. de la Harpe (Eds.), Sur les Groupes Hyperboliques d'Aprés Mikhael Gromov, Progr. Math. Ser., Vol. 83, Birkhäuser, Berlin, 1990.
33. R. Grigorchuck, Symmetrical random walks on discrete groups, in: Multicomponent Random Systems, in: Adv. Probab. Related Topics, Vol. 6, Dekker, New York, 1980, pp. 285-325.
34. M. Gromov, Hyperbolic groups, Essays in Group Theory, Springer, New York, 1987, pp. 75-263.
35. M. Gromov, Asymptotic invariants of infinite groups, in: Geometric Group Theory, Vol. 2, Sussex, 1991, Cambridge Univ. Press, Cambridge, 1993, pp. 1-295.
36. M. Gromov, Random walks in random groups, preprint.
37. Y. Gurevich, Average case completeness, J. Comput. System Sci. 42 (1991) 346-398.
38. D. Holt, Word-hyperbolic groups have real-time word problem, Internat. J. Algebra Comput. 10 (2000) 221-227.
39. D. Holt, S. Rees, Solving the word problem in real time, J. London Math. Soc. (2) 63 (2001) 623-639.
40. I. Kapovich, The non-amenability of Schreier graphs for infinite index quasiconvex subgroups of hyperbolic groups, Ensign. Math. 48 (3-4) (2002) 359-375.
41. V. Klee, G. Minty, How good is the simplex algorithm? Inequalities III, Proc. Third Sympos., Univ. California, Los Angeles, CA, 1969; Dedicated to the memory of Theodore S. Motzkin, Academic Press, New York, 1972, pp. 159-175.
42. L. Levin, Average case complete problems, SIAM J. Comput. 15 (1986) 285-286.
43. R. Lipton, Y. Zalcstein, Word problems solvable in logspace, J. Assoc. Comput. Mach. 24 (3) (1977) 522-526.
44. R.C. Lyndon, P.E. Schupp, Combinatorial Group Theory, in: Ergeb. Math., Band 89, Springer, Berlin, 1977, Reprinted in the Springer Classics in Mathematics series, 2000.
45. W. Magnus, Das Identitätsproblem für Gruppen mit einer definierenden relation, Math. Ann. 106 (1932) 295-307.
46. K.A. Mihailova, The occurrence problem for direct products of groups, Dokl. Akad. Nauk SSSR 119 (1958) 1103-1105.
47. C.F. Miller III, On Group-theoretic Decision Problems and their Classification, in: Ann. of Math. Stud., Vol. 68, Princeton University Press, Princeton, NJ, 1971.
48. C.F. Miller III, Decision problems for groups-Survey and reflections, in: G. Bamuslag, C.F. Miller III (Eds.), Algorithms and Classification in Combinatorial Group Theory, Springer, Berlin, 1992, pp. 1-60.
49. A.D. Miasnikov, A.G. Myasnikov, Whitehead's descent and heuristic algorithms, Preprint, 2002.
50. A.Yu. Ol'shanskii, Almost every group is hyperbolic, Internat. J. Algebra Comput. 2 (1992) 1-17.
51. C. Papadimitriou, Computation Complexity, Addison-Wesley, Reading, MA, 1994.
52. J. Rotman, An Introduction to the Theory of Groups, 4th Edition, in: Grad. Texts in Math., Vol. 148, Springer, New York, 1995.
53. P.E. Schupp, Coxeter groups, 2-completion, perimeter reduction and subgroup separability, Geometrica Dedicata, to appear.
54. H. Short, An introduction to automatic groups, in: Semigroups, Formal Languages and Groups, York, 1993, in: NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., Vol. 466, Kluwer Academic, Dordrecht, 1995, pp. 233-253.
55. R. Spigler, M. Vianello, Cesàro's theorems for complex sequences, J. Math. Anal. Appl. 180 (2) (1993) 317-324.
56. J. Tits, Free subgroups in linear groups, J. Algebra 20 (1972) 250-270.
57. A. Ushakov, Genetic algorithms for the conjugacy problem in one-relator groups, in preparation.
58. A.M. Vershik, Dynamic theory of growth in groups: Entropy, boundaries, examples, Uspekhi Mat. Nauk (334) 55 (4) (2000) 59-128; in Russian translation: Math. Surveys 55 (4) (2000) 667-733.
59. N. Wagner, M. Magyarik, A public-key cryptosystem based on the word problem, in: Advances in Cryptology, Santa Barbara, CA, 1984, in: Lecture Notes in Comput. Sci., Vol. 196, Springer, Berlin, 1985, pp. 19-36.
60. J. Wang, Average-case completeness of a word problem in groups, in: Proc. of the 27th Annual Symposium on Theory of Computing, ACM Press, New York, 1995, pp. 325-334.
61. J. Wang, Average-case computational complexity theory, in: Complexity Theory Retrospective, Vol. II, Springer, New York, 1997, pp. 295-334.
62. J. Wang, Distributional word problem for groups, SIAM J. Comput. 28 (4) (1999) 1264-1283.
63. W. Woess, Cogrowth of groups and simple random walks, Arch. Math. 41 (1983) 363-370.
64. W. Woess, Random walks on infinite graphs and groups-A survey on selected topics, Bull. London Math. Soc. 26 (1994) 1-60.
65. A. Zuk, On property (T) for discrete groups, in: Rigidity in Dynamics and Geometry, Cambridge, 2000, Springer, 2002, pp. 473-482.