The -core tower places at level the -cores of all partitions at level of the quotient tower of a partition. If is the sum of the sizes at quotient level and the sum at core level , then
For a prime number , integer , and , taking the -core of a partition preserves the entries of the core tower of a partition at levels and makes every level at least empty. Also the weight of a partition equals the total size at level of the quotient tower of a partition.
For the first claim, a removable rim hook of length is a bead move by on the abacus of a partition. It preserves the numbers of beads on the runners and hence the -core. Under the abacus divisible-hook correspondence, it becomes removal of a -hook in one quotient component; iteration preserves the cores at the next levels. After all -hooks are removed, every component at quotient level is empty, so every higher core level is empty as well. The weight assertion follows from iterated quotient equals a power quotient up to permutation and the size formula for the quotient of a partition.
If and is its base- digit sum, then
This combines the Hook-length formula, Legendre formula, the abacus divisible-hook correspondence, and the recurrence .
Let be a prime number, let with , and let be the sum of partition sizes at level of the core tower of a partition . Then
Indeed . Carrying units from position to position decreases by . Normalization to the base- digits therefore gives , with equality exactly when no carry is needed. The P-adic valuation of a symmetric-group character degree from the core tower is the difference divided by .
For every partition ,
The core-tower formula reduces this to subadditivity of the base- digit sum across the sizes of the quotient partitions.

Articles by others on the same topic (0)

There are currently no matching articles.