Core-quotient bijection for partitions
ID: core-quotient-bijection-for-partitions
Fix a positive integer . A partition of an integer is uniquely specified by its core of a partition for modulus and its ordered quotient of a partition for that modulus. More precisely, for every -core and ordered tuple of partitions, there is a unique partition such thatThe ordered runners use the usual abacus of a partition convention with a number of beads divisible by . Adding beads preserves both the tuple and its runner labels. The core fixes the relative runner offsets, and each component partition fixes the displacement of the beads on that runner, giving existence and uniqueness.
New to topics? Read the docs here!