Growth in SL2 over finite fields

Journal of Group Theory

Volumn 14, Issue 2, 2011, Pages 273-297

  Dinai, Oren ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79953814858     PISSN: 14335883     EISSN: 14354446     Source Type: Journal    
DOI: 10.1515/JGT.2010.056     Document Type: Article

References (38)

1. M. Abért and L. Babai. Finite groups of uniform logarithmic diameter. Israel J. Math. 158 (2007), 193-203.
2. L. Babai, G. Hetyei, W. M. Kantor, A. Lubotzky and A. Seress. On the diameter of finite groups. In 31st annual symposium on foundations of computer science II (1990), 857-865.
3. L. Babai, W. M. Kantor, and A. Lubotzky. Small diameter Cayley graphs for finite simple groups. European J. Comb. 10 (1989), 507-522.
4. L. Babai, N. Nikolov and L. Pyber. Product growth and mixing in finite groups. In Proc. 19th annual ACM-SIAM symposium on discrete algorithms (SIAM, 2008), pp. 248-257.
5. L. Babai, N. Nikolov and L. Pyber. Expansion and product decomposition of finite groups: variation on a theme of Gowers. Preprint.
6. L. Babai and A. Seress. On the diameter of Cayley graphs of the symmetric group. J. Combin. Theory Ser. A 49 (1988), 175-179.
7. L. Babai and A. Seress. On the diameter of permutation groups. European J. Combin. 13 (1992), 231-243.
8. J. Bourgain and A. Gamburd. New results on expanders. C. R. Math. Acad. Sci. Paris 342 (2006), 717-721.
9. p. Ann. of Math. (2) 167 (2008), 625-642.
10. J. Bourgain and A. Gamburd. On the spectral gap for finitely-generated subgroups of SU2. Invent. Math. 171 (2008), 83-121.
11. J. Bourgain, N. Katz and T. Tao. A sum-product estimate in finite fields and applications. Geom. Funct. Anal. 14 (2004), 27-57.
12. J. Bourgain, A. Glibichuk and S. Konyagin. Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order. J. London Math. Soc. (2) 73 (2006), 380-398.
13. T. C. Brown and J. P. Buhler. A density version of a geometric Ramsey theorem. J. Combin. Theory Ser. A 32 (1982), 20-34.
14. C. de Concini and C. Procesi. A characteristic free approach to invariant theory. Adv. In Math. 21 (1976), 330-354.
15. O. Dinai. Poly-log diameter bounds for some families of finite groups. Proc. Amer. Math. Soc. 134 (2006), 3137-3142.
16. O. Dinai. Expansion properties of finite simple groups. Ph.D. thesis. The Hebrew University (2009). .
17. J. D. Dixon. The probability of generating the symmetric group. Math. Z. 110 (1969), 199-205.
18. S. Donkin. Invariants of several matrices. Invent. Math. 110 (1992), 389-401.
19. M. Domokos, S. G. Kuzmin and A. N. Zubkov. Rings of matrix invariants in positive characteristic. J. Pure Appl. Algebra 176 (2002), 61-80.
20. J. R. Driscoll and M. L. Furst. Computing short generator sequences. Inform. and Comput. 72 (1987), 117-132.
21. S. Even and O. Goldreich. The minimum length generator sequence is NP-hard. J. Algorithms 2 (1981), 311-313.
22. P. Erdos and A. Renyi. Probabilistic methods in group theory. 3. J. Anal. Math. 14 (1965), 127-138.
23. P. Erdos and P. Turan. On some problems of a statistical group theory. I. Z. Wahrscheinlichkeitstheorie Verw. Gebiete 4 (1965), 175-186.
24. P. Erdos and P. Turan. On some problems of a statistical group theory. II. Acta Math. Acad. Sci. Hung. 18 (1967), 151-163.
25. W. T. Gowers. Quasirandom groups. Combin. Probab. Comput. 17 (2008), 363-387.
26. pℤ. Ann. of Math. (2) 167 (2008), 601-623.
27. M. Jerrum. The complexity of finding minimum length generator sequences. Theoret. Comput. Sci. 36 (1985), 265-289.
28. p Internat. Math. Res. Notices 27 (2003), 1465-1471.
29. M. W. Liebeck and A. Shalev. Diameters of finite simple groups: sharp bounds and applications. Ann. of Math. (2) 154 (2001), 383-406.
30. P. McKenzie. Permutations of bounded degree generate groups of polynomial diameter. Info. Proc. Lett. 19 (1984), 253-254.
31. N. Nikolov and L. Pyber. Product decompositions of quasirandom groups and a Jordan type theorem. Preprint (2007). http://arxiv.org/abs/math/0703343.
32. F. P. Preparata and J. Vuillemin. The cube connected cycles: a versatile network for parallel computation. Comm. ACM 24 (1981), 300-309.
33. C. Procesi. Invariant theory of n×n matrices. Adv. in Math. 19 (1976), 306-381.
34. C. Procesi. Computing with 2×2 matrices. J. Algebra 87 (1984), 342-359.
35. 2q. J. Algebra 258 (2002), 651-657.
36. H. S. Stone. Parallel processing with the perfect shu.e. IEEE Trans. Comput. 100 (1971), 153-161.
37. T. Tao. The sum-product phenomenon in arbitrary rings. Contrib. Discrete Math. 4 (2009), 59-82.
38. T. Tao and V. Vu. Additive combinatorics (Cambridge University Press, 2006).