The Smallest Faithful Permutation Degree for a Direct Product Obeying an Inequality Condition
Neil Saunders, David Easdown

TL;DR
This paper investigates the minimal faithful permutation degree of direct product groups, establishing that for degrees up to 9, the degree of the product equals the sum of individual degrees, with 10 being the minimal counterexample.
Contribution
The paper proves that the minimal faithful permutation degree of a direct product of groups equals the sum of degrees for all cases up to 9, identifying 10 as the minimal degree where strict inequality can occur.
Findings
For degrees ≤ 9, μ(G×H) = μ(G) + μ(H).
10 is the smallest degree where μ(G×H) < μ(G) + μ(H).
The result characterizes the minimal faithful permutation degrees for small groups.
Abstract
The minimal faithful permutation degree of a finite group is the least nonnegative integer such that embeds in the symmetric group . Clearly for all finite groups and . Wright (1975) proves that equality occurs when and are nilpotent and exhibits an example of strict inequality where embeds in . Saunders (2010) produces an infinite family of examples of permutation groups and where , including the example of Wright's as a special case. The smallest groups in Saunders' class embed in . In this paper we prove that 10 is minimal in the sense that for all groups and such 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.
