On the number of fixed point free elements in a permutation group

DOI10.1016/0012-365X(92)90540-VzbMath0813.20001OpenAlexW1969579315MaRDI QIDQ1199592

Peter J. Cameron, Arjeh M. Cohen

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90540-v

zbMATH Keywords

degreelower boundsminimal degreefixed-point free elementstransitive permutation grouppermutation rank

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) General theory for finite permutation groups (20B05) Multiply transitive finite groups (20B20)

Related Items (24)

Bounds on the number and sizes of conjugacy classes in finite Chevalley groups with applications to derangements ⋮ Primitive permutation groups and derangements of prime power order. ⋮ Products of derangements in simple permutation groups ⋮ On the size of coset unions ⋮ Conjugacy classes of derangements in finite transitive groups ⋮ Transitive permutation groups in which all derangements are involutions. ⋮ Bounds for fixed point free elements in a transitive group and applications to curves over finite fields ⋮ The Hasse principle for finite Galois modules allowing exceptional sets of positive density ⋮ Covering and growth for group subsets and representations ⋮ Invariable generation and the Chebotarev invariant of a finite group. ⋮ Derangements in wreath products of permutation groups ⋮ Arithmetic functions and fixed points of powers of permutations ⋮ Groups generated by derangements ⋮ Prime order derangements in primitive permutation groups. ⋮ 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 a theorem of Jordan ⋮ The complexity of the weight problem for permutation and matrix groups. ⋮ Distribution of factorials modulo \(p\) ⋮ Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy ⋮ On cyclic semi-regular subgroups of certain 2-transitive permutation groups ⋮ On fixed points of permutations. ⋮ The complexity of the Weight Problem for permutation groups ⋮ Finding fixed point free elements and small bases in permutation groups

Cites Work

• On the order of uniprimitive permutation groups
• Minimal Degrees of Primitive Permutation Groups, with an Application to Monodromy Groups of Covers of Riemann Surfaces

This page was built for publication: On the number of fixed point free elements in a permutation group