Skip to main content

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
Cancel
×
×
Home
  • Home
Article
  • Cited by 12
  • Cited by
    Crossref Citations
    Crossref logo
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.
    Burness, Timothy C. Guralnick, Robert M. and Saxl, Jan 2014. Base sizes for S-actions of finite classical groups. Israel Journal of Mathematics, Vol. 199, Issue. 2, p. 711.
    Fawcett, Joanna B. 2013. The base size of a primitive diagonal group. Journal of Algebra, Vol. 375, Issue. , p. 302.
    Neunhöffer, Max Noeske, Felix OʼBrien, E.A. and Wilson, Robert A. 2011. Orbit invariants and an application to the Baby monster. Journal of Algebra, Vol. 341, Issue. 1, p. 297.
    Burness, Timothy C. O’Brien, E. A. and Wilson, Robert A. 2010. Base sizes for sporadic simple groups. Israel Journal of Mathematics, Vol. 177, Issue. 1, p. 307.
    Bailey, Robert F. and Cameron, Peter J. 2008. On the single-orbit conjecture for uncoverings-by-bases. Journal of Group Theory, Vol. 11, Issue. 6,
    Kantor, William M. 2008. Universal families of permutation groups. Journal of Algebraic Combinatorics, Vol. 28, Issue. 3, p. 351.
    Burness, Timothy C. 2007. Fixed point ratios in actions of finite classical groups, I. Journal of Algebra, Vol. 309, Issue. 1, p. 69.
    James, J.P. 2006. Two point stabilisers of partition actions of linear groups. Journal of Algebra, Vol. 297, Issue. 2, p. 453.
    Praeger, Cheryl E. and Shalev, Aner 2001. Bounds on finite quasiprimitive permutation groups. Journal of the Australian Mathematical Society, Vol. 71, Issue. 02, p. 243.
    Gluck, David Seress, Ákos and Shalev, Aner 1998. Bases for Primitive Permutation Groups and a Conjecture of Babai. Journal of Algebra, Vol. 199, Issue. 2, p. 367.
    Shalev, Aner 1998. A Theorem on Random Matrices and Some Applications. Journal of Algebra, Vol. 199, Issue. 1, p. 124.
    Cameron, P.J and Fon-Der-Flaass, D.G 1995. Bases for permutation groups and matroids. European Journal of Combinatorics, Vol. 16, Issue. 6, p. 537.
    ×
  • Get access
    Add to cart USD35.00
    Check if you have access via personal or institutional login
    Log in Register Recommend to librarian

Random Permutations: Some Group-Theoretic Aspects

  • Peter J. Cameron (a1) and William M. Kantor (a2)
Abstract

The study of asymptotics of random permutations was initiated by Erdős and Turáan, in a series of papers from 1965 to 1968, and has been much studied since. Recent developments in permutation group theory make it reasonable to ask questions with a more group-theoretic flavour. Two examples considered here are membership in a proper transitive subgroup, and the intersection of a subgroup with a random conjugate. These both arise from other topics (quasigroups, bases for permutation groups, and design constructions).

Copyright
COPYRIGHT: © Cambridge University Press 1993
References
Hide All
[1]Cameron, P. J. (1981) Finite permutation groups and finite simple groups. Bull. London Math. Soc. 13 1–22.
[2]Cameron, P. J. (1992) Almost all quasigroups have rank 2. Discrete Math. 106/107 111–115.
[3]Cameron, P. J., Neumann, P. M. and Teague, D. N. (1982) On the degrees of primitive permutation groups. Math. Z. 180 141–149.
[4]Dixon, J. D. (1969) The probability of generating the symmetric group. Math. Z. 110 199–205.
[5]Donnelly, P. and Grimmett, G. (to appear) On the asymptotic distribution of large prime factors. J. London Math. Soc.
[6]Erdős, P. and Rényi, A. (1963) Asymmetric graphs. Acta Math. Acad. Sci. Hungar. 14 295–315.
[7]Erdős, P. and Turán, P. (1965) On some problems of a statistical group theory, I. Z. Wahrschein lichkeitstheorie und verw. Gebeite. 4 175–186.
[8]Erdős, P. and Turán, P. (1967) On some problems of a statistical group theory, II. Acta Math. Acad. Sci. Hungar. 18 151–163.
[9]Erdős, P. and Turán, P. (1967) On some problems of a statistical group theory, III. Acta Math Acad. Sci. Hungar. 18 309–320.
[10]Erdős, P. and Turán, P. (1968) On some problems of a statistical group theory, IV. Acta Math Acad. Sci. Hungar. 19 413–435.
[11]Frucht, R. (1938) Herstellung von Graphen mit vorgegebener abstrakter Gruppe. Compositio Math. 6 239–250.
[12]Kantor, W. M. (1988) Algorithms for Sylow p-subgroups and solvable groups. Computers in Algebra. (Proc. Conf. Chicago 1985), Dekker, New York77–90.
[13]Kantor, W. M. (to appear) Automorphisms and isomorphisms of symmetric and affine designs. J. Algebraic Combinatorics.
[14]Liebeck, M. W. and Saxl, J. (1991) Minimal degrees of primitive permutation groups, with an application to monodromy groups of covers of Riemann surfaces. Proc. London Math. Soc. (2). 63 266–314.
[15]Luczak, T. and Pyber, L. (to appear) Combinatorics, Probability and Computing.
[16]Smith, J. D. H. (1986) Representation Theory of Infinite Groups and Finite Quasigroups, Sém. Math. Sup., Presses Univ. Montréal, Montréal.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *

CAPTCHA *

Skip to the audio challenge
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 15 *
Loading metrics...

Abstract views

Total abstract views: 84 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 12th June 2018. This data will be updated every 24 hours.

Cancel
Confirm
×