Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-26T00:49:42.327Z Has data issue: false hasContentIssue false
  • English
  • Français

Trivial Set-Stabilizers in Finite Permutation Groups

Published online by Cambridge University Press:  20 November 2018

David Gluck
David Gluck*
Affiliation:
University of Wisconsin, Madison, Wisconsin
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

For which permutation groups does there exist a subset of the permuted set whose stabilizer in the group is trivial?

The permuted set has so many subsets that one might expect that subsets with trivial stabilizer usually exist. The symmetric and alternating groups are obvious exceptions to this expectation. Another, more interesting, infinite family of exceptions are the 2-Sylow subgroups of the symmetric groups on 2n symbols, in their natural representations on 2n points.

One of our main results, Corollary 1, sheds some light on this last family of groups. We show that when the permutation group has odd order, there is indeed a subset of the permuted set whose stabilizer in the group is trivial. Corollary 1 follows easily from Theorem 1, which completely classifies the primitive solvable permutation groups in which every subset of the permuted set has non-trivial stabilizer.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 35 , Issue 1 , 01 February 1983 , pp. 59 - 67
Copyright
Copyright © Canadian Mathematical Society 1983

References

1. Suprunenko, D., Matrix groups, Translations of Mathematical Monographs 45 (American Mathematical Society, Providence, R.I., 1976).Google Scholar
2. Wolf, T., Solvable and nilpotent subgroups of GL(n, qm), to appear in Can. J. Math.Google Scholar