Representation theory of the group of automorphisms of a finite rooted tree
Abstract
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions, a natural generalization of set compositions but with new features and more complexity. These combinatorial structures lead to a family of permutation representations which have the same parametrization of the irreducible representations. Our trees are not necessarily spherically homogeneous and our approach is coordinate free.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.