Enumerative combinatorics
Hi-index | 0.01 |
A new family of trees, defined in term of Young diagrams, is introduced. Values of central characters of the symmetric group are represented as a weighted enumeration of such trees. The proof involves a new decomposition theorem for representations corresponding to general shapes.