The M\"obius function of the small Ree groups
Emilio Pierro

TL;DR
This paper computes the M"obius function for small Ree groups, revealing their subgroup structure and applications in counting generating sets, dessins d'enfants, and probabilistic group generation.
Contribution
It determines the M"obius function of small Ree groups and describes their maximal subgroups using permutation representations, advancing understanding of their algebraic and combinatorial properties.
Findings
Calculated the M"obius function for small Ree groups.
Described maximal subgroups via permutation representations.
Applied results to counting epimorphisms and probabilistic generation.
Abstract
The M\"obius function for a group, , was introduced in 1936 by Hall in order to count ordered generating sets of . In this paper we determine the M\"obius function of the simple small Ree groups, where for , using their 2-transitive permutation representation of degree and describe their maximal subgroups in terms of this representation. We then use this to determine Epi for various , such as or the modular group , with applications to Grothendieck's theory of dessins d'enfants as well as probabilistic generation of the small Ree groups.
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 · graph theory and CDMA systems · Coding theory and cryptography
