No label defined (Q4550663)

This paper presents various results in the field of permutation groups, more precisely concerning the relations between fixed points, orbits, and cycles. The author first discusses extensions of the Orbit-Counting Lemma (in a finite permutation group, the number of orbits is equal to the average number of fixed points of its elements). Boston et al. found a relation between the probabilities of fixing \(i\) points and the numbers of orbits on \(i\)-tuples, using generating functions. After some considerations on an adaptation of the Boston et al. theorem to infinite permutation groups, the author uses it in the case of linear groups (and in particular of symplectic groups). Remark that this theorem is a special case of an older result about the Redfield-Pólya cycle index. Next the author examines what can be said about a permutation group of which we know the set of cycle partitions of its elements. This set determines the order, the multiset of cycle partitions and the cycle index of the group, but not the group itself, even up to isomorphism as an abstract group. Then the author looks at questions concerning derangements (permutations without fixed points) in finite permutation groups. Fein et al. proved that each such group must contain a derangement of prime power order. A permutation group is called `elusive' if it is transitive and has no derangement of prime order. For instance \(M_{11}\) in its action on \(12\) points is elusive. Results of M. Giudici on elusive groups are given. The author concludes with considerations and questions on derangements and Latin squares, cycle closed groups, and Parker vectors. Several open problems are mentioned along the way. For the entire collection see [Zbl 0985.00021].