Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 1057-1066

  Babai, László ^a   Hayes, Thomas P ^b  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PERMUTATIONS; POLYNOMIAL TIME; STATISTICAL THEORY;

APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES; STATISTICAL TESTS; THEOREM PROVING;

SET THEORY;

EID: 20744451398     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. N. ALON, J. SPENCER: The Probabilistic Method. Wiley-lnterscience, 1992.
2. L. BABAI: The probability of generating the symmetric group. J. Comb. Th.-A 52 (1989), 148-153.
3. L. BABAI, R. BEALS, Á. SERESS: On the diameter of the symmetric group: polynomial bounds. 15th ACM-SIAM SODA (2004), 1101-1105.
4. L. BABAI, G. L. HETYEI: On the diameter of random Cayley graphs of the symmetric group. Combinatorics, Probability, and Computing 1 (1992), 201-208.
5. L. BABAI, G. HETYEI, W.M. KANTOR, A. LUBOTSKY, Á. SERESS: On the diameter of finite groups. 31st IEEE FOCS, 1990, pp. 857-865.
6. L. BABAI, Á. SERESS: On the Degree of Transitivity of Permutation Groups: A Short Proof. J. Combinatorial Theory-A 45 (1987), 310-314.
7. L. BABAI, Á. SERESS: On the diameter of Cayley graphs of the symmetric group. J. Combinatorial Theory-A 49 (1988), 175-179.
8. J. D. BOVEY: The probability that some power of a permutation has small degree. Bull. London Math. Soc. 12 (1980), 47-51.
9. J. D. DIXON: The probability of generating the symmetric group. Math. Z. 110 (1969), 199-205.
10. J. R. DRISCOLL, M. L. FÜRST: Computing short generator sequences. Info. & Comp. 72 (1987), 117-132.
11. P. ERDOS, P. TURÁN: On some problems of a statistical group theory I., Z. Wahrscheinlichkeitstheorie verw. Geb. 4 (1965), 175-186.
12. P. ERDOS AND P. TURÁN: On some problems of a statistical group theory III, Acta Math. Acad. Sci. Hung. 18 (1967), 309-320.
13. P. ERDOS AND P. TURÁN: On some problems of a statistical group theory VII, Period. Math. Hung. 2 (1972), 149-163.
14. S. EVEN, O. GOLDREICH: The minimum length generator sequence is NP-hard. J. Algor. 2 (1981), 311-313.
15. V.L. GONCHAROV: On the Field of Combinatory Analysis, Isvestija Akad. Nauk. SSSR, Ser. mat. 8 (1944), 3-48
16. (Russian. English translation: Translations of the AMS, Ser. 2, 19 (1962), 1-46.)
17. M-C. HEYDEMANN: Cayley graphs and interconnection networks. In: Graph Symmetry (Montreal, 1996), NATO Adv. Sci. Inst. Ser. C, Math. Phys. Sci. 497, Kluwer Acad. Publ., Dordrecht 1997, pp. 167-224.
18. W. HOEFFDING: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58 (1963), 13-30.
19. M. R. JERRUM: The complexity of finding minimum length generator sequences. Theoretical Computer Science 36 (1985), 265-289.
20. R. E. KORF: Finding optimal solutions to Rubik's Cube using pattern databases. In: Proc. 14th Nat. Conf. on Artificial Intelligence (AAAI-97), Amer. Assoc. for Artificial Intelligence, 1997, pp. 700-705.
21. L. LOVÁSZ: Combinatorial Problems and Exercises. Akadémiai Kiadó, Budapest, and North-Holland, Amsterdam, 1979.
22. P. MCKENZIE: Permutations of bounded degree generate groups of polynomial diameter. Info. Proc. Lett. 19 (1984), 253-254.
23. R. MOTWANI, P. RAGHAVAN: Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
24. Á. SERESS: Permutation Group Algorithms. Cambridge Univ. Press, 2003.