Total closure for permutation actions of finite nonabelian simple groups
Saul D. Freedman, Michael Giudici, Cheryl Praeger

TL;DR
This paper determines the minimal number of Cartesian factors needed for finite simple groups to be totally closed under group actions, revealing exact values for alternating groups and bounds for classical groups.
Contribution
It provides the first comprehensive bounds and exact values for the closure number $k(G)$ for various classes of finite simple groups, including alternating and classical groups.
Findings
$k(A_n)=n-1$ for alternating groups
$k(G) ext{ is at most }7$ for most simple groups
$k(G) ext{ is at most } n+2$ for classical groups with dimension } n$
Abstract
For a positive integer , a group is said to be totally -closed if for each set upon which acts faithfully, is the largest subgroup of that leaves invariant each of the -orbits in the induced action on . Each finite group is totally -closed, and denotes the least integer such that is totally -closed. We address the question of determining the closure number for finite simple groups . Prior to our work it was known that for cyclic groups of prime order and for precisely six of the sporadic simple groups, and that for all other finite simple groups. We determine the value for the alternating groups, namely . In addition, for all simple groups , other than alternating groups and classical groups, we show that .…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
