The minimal degree of permutation representations of finite groups
Oren Becker

TL;DR
This thesis investigates the minimal degree of permutation representations of finite groups, providing explicit formulas for abelian groups, analyzing behavior under direct products, and introducing a compression ratio to measure embedding efficiency.
Contribution
It offers an explicit formula for abelian groups' minimal permutation degree, studies how this property behaves under direct products, and introduces the compression ratio as a new measure of embedding optimality.
Findings
Explicit formula for abelian groups' permutation degree
Behavior of permutation degree under direct products
Introduction of the compression ratio as a new metric
Abstract
In this thesis we study the following property of a finite group G: the minimal number n such that G embeds in Sn. We start with an explicit formula for the number n for abelian groups. Then, we study the behavior of this group property in respect to direct products. Finally, we define and explore the "compression ratio" of a finite group G which measures how much better the best embedding is relative to the embedding given by Cayley's theorem.
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
Topicsgraph theory and CDMA systems · Finite Group Theory Research · Coding theory and cryptography
