Permutation characters and fixed-point-free elements in permutation groups.

DOI10.1016/J.JALGEBRA.2006.03.015MaRDI QIDQ2497442zbMATH OpenOpenAlexFDO

Authors Pablo Spiga

Publication date 4 August 2006

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgebra.2006.03.015

zbMATH Keywords

finite permutation groupsfinite transitive permutation groupsfixed-point-free elementsmaximal subgroupspermutation characterssoluble groupstransitive permutation representationsunions of conjugacy classes

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Multiply transitive finite groups (20B20) Ordinary representations and characters (20C15)

Review text

Let \(G\) be a finite transitive permutation group, and \(H\) a subgroup of \(G\). The union of the \(G\)-conjugacy classes of \(H\) is denoted by \(c(H)\). One sees easily that the set of fixed-point-free elements of \(G\) is \(G\setminus c(G_\alpha)\), where \(G_\alpha\) is a point stabiliser of \(G\). The main theorem states that if a group of nilpotency class 2 has two subgroups \(H\) and \(K\) with \(c(H)=c(K)\) then \(H\) and \(K\) are isomorphic. As a corollary, if a group \(G\) of nilpotency class 2 admits two transitive permutation representations with the same set of fixed-point-free elements, then the permutation characters of the two representations are equal. The author displays several counterexamples for groups of nilpotency class 3. In the last section, the author studies the equation \(c(H)=c(K)\) in more generality; in particular for soluble groups and maximal subgroups. A conjecture is made that for maximal subgroups \(H\) and \(K\) of a finite group, if \(c(H)=c(K)\), then the characters \(1_H^G\) and \(1_K^G\) are comparable, i.e., they are equal or their difference is a character. The author divides the proof in different cases using the O'Nan Scott theorem and proves all cases but the almost simple one.

Recommendations

• On a conjecture on the permutation characters of finite primitive groups
• Permutation groups whose non-identity elements have k fixed points
• Theorems like Wielandt's
• A Note on Permutation Groups
• The fixity of permutation groups

Cites work

• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 490861 (Why is no real title available?)
• scientific article; zbMATH DE number 1151371 (Why is no real title available?)
• scientific article; zbMATH DE number 2152953 (Why is no real title available?)
• scientific article; zbMATH DE number 278882 (Why is no real title available?)
• On the equation \(\zeta_K(s)=\zeta_{K'}(s)\)
• Primitive Subgroups of Wreath Products in Product Action
• Solvable generation of groups and Sylow subgroups of the lower central series

Cited in

(13)

• On the normal subgroup with exactly two G-conjugacy class sizes.
• A note on multiplicity-free permutation characters
• Finding fixed point free elements and small bases in permutation groups
• On a conjecture on the permutation characters of finite primitive groups
• Conjugacy in Permutation Representations of the Symmetric Group
• Characterizing a family of elusive permutation groups
• Strange permutation representations of free groups
• Isospectral drums and simple groups
• Permutation characters in finite solvable groups
• On fixed points of elements in primitive permutation groups.
• A remark on the permutation representations afforded by the embeddings of \(\mathrm O^\pm_{2m}(2^f)\) in \(\mathrm{Sp}_{2m}(2^f)\).
• scientific article; zbMATH DE number 6300250 (Why is no real title available?)
• Fixers and derangements of finite permutation groups

Describes a project that uses

Uses Software

• GAP

This page was built for publication: Permutation characters and fixed-point-free elements in permutation groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497442)