Sylow branching trees for symmetric groups
Eugenio Giannelli, Stacey Law

TL;DR
This paper introduces Sylow branching trees for symmetric groups, providing a combinatorial framework to describe Sylow branching coefficients for all irreducible characters of Sylow p-subgroups, extending prior work on linear characters.
Contribution
It develops a novel combinatorial tree-based method to analyze Sylow branching coefficients for symmetric groups, generalizing previous results on linear characters.
Findings
Describes Sylow branching coefficients using labelled p-ary trees.
Extends previous work from linear characters to all irreducible characters.
Provides a comprehensive combinatorial characterization for symmetric groups.
Abstract
Let be a prime and let be a Sylow -subgroup of a finite symmetric group. To every irreducible character of we associate a collection of labelled, complete -ary trees. The main results of this article describe Sylow branching coefficients for symmetric groups for all irreducible characters of in terms of some combinatorial properties of these trees, extending previous work on the linear characters of .
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
TopicsAdvanced Graph Theory Research
