On fixed points of permutations.

DOI10.1007/S10801-008-0135-2zbMath1192.20001arXiv0708.2643OpenAlexW2132824499MaRDI QIDQ1024810

Persi Diaconis, Jason Fulman, Robert M. Guralnick

Publication date: 17 June 2009

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0708.2643

zbMATH Keywords

finite permutation groupsPoisson distributionlimiting distributionsderangementsrandom permutationsfinite alternating groupsfinite symmetric groupsnumbers of fixed pointsO'Nan-Scott theoremprimitive actions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Combinatorial probability (60C05) General theory for finite permutation groups (20B05) Probabilistic methods in group theory (20P05) Multiply transitive finite groups (20B20)

Related Items (19)

Bounds on the number and sizes of conjugacy classes in finite Chevalley groups with applications to derangements ⋮ Imprimitive permutations in primitive groups ⋮ Fixed points and matching points in partitions ⋮ Closed expressions for averages of set partition statistics ⋮ Conjugacy classes of derangements in finite transitive groups ⋮ On the number of distinct functional graphs of affine-linear transformations over finite fields ⋮ Random generation with cycle type restrictions ⋮ Derangements in subspace actions of finite classical groups ⋮ Derangements in wreath products of permutation groups ⋮ Arithmetic functions and fixed points of powers of permutations ⋮ Derangements in finite classical groups for actions related to extension field and imprimitive subgroups and the solution of the Boston–Shalev conjecture ⋮ On a relation between the rank and the proportion of derangements in finite transitive permutation groups. ⋮ On the number of derangements and derangements of prime power order of the affine general linear groups ⋮ Permanental generating functions and sequential importance sampling ⋮ On the generating graphs of symmetric groups ⋮ Fixed points of a random restricted growth sequence ⋮ Permutations contained in transitive subgroups ⋮ Unnamed Item ⋮ A Random Permutation Model Arising in Chemistry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximal subgroups of the finite classical groups
• A classification of certain maximal subgroups of symmetric groups.
• On a balanced property of derangements
• Exchangeable pairs and Poisson approximation
• Matching theory
• A classification of the maximal subgroups of the finite alternating and symmetric groups
• The problem of coincidences
• On the order of uniprimitive permutation groups
• On the cohomology of alternating and symmetric groups and decomposition of relation modules
• Probability approximations via the Poisson clumping heuristic
• Random sets which invariably generate the symmetric group
• On the number of fixed point free elements in a permutation group
• The cycle structure of random permutations
• On the minimal degree of a primitive permutation group
• Descent classes of permutations with a given number of fixed points
• Chebotarëv and his density theorem
• A theorem on random matrices and some applications
• Bounds for fixed point free elements in a transitive group and applications to curves over finite fields
• The theory of finite groups. An introduction.
• Card shuffling and the decomposition of tensor products.
• Gray code for derangements
• Probabilistic generation of finite simple groups
• Riffle shuffles, cycles, and descents
• Random walks on trees and matchings
• Derangements and tensor powers of adjoint modules for \(\mathfrak{sl}_n\)
• Conjugacy class properties of the extension of \(\text{GL}(n,q)\) generated by the inverse transpose involution.
• A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
• Constant time generation of derangements
• Convergence rates of random walk on irreducible representations of finite groups
• The probability of generating a finite classical group
• Derangements in subspace actions of finite classical groups
• The proportion of fixed-point-free elements of a transitive permutation group
• On the Orders of Maximal Subgroups of the Finite Classical Groups
• The Probability that some Power of a Permutation has Small Degree
• Permutation Groups Containing Affine Groups of the Same Degree
• Matchings and phylogenetic trees
• On Random Generation of the Symmetric Group
• Analysis of Top To Random Shuffles
• On the Eigenvalues of Random Matrices
• On a theorem of Jordan
• Absolute Fourth Moments and Finiteness of Linear Groups
• Ordered Cycle Lengths in a Random Permutation
• The distribution of polynomials over finite fields
• The Riemann zeta and allied functions
• Maximal subgroups of finite groups
• The probability of generating the symmetric group

This page was built for publication: On fixed points of permutations.