Choose timezone
Your profile timezone:
Integer partitions λ ⊢ n are combinatorial objects with well known
applications in other areas of mathematics. A map on the set of partitions
of a given n ≥ 2 is known to partially determine the structure of important
representations of the symmetric group Sn; the group of permutations of n
elements. In this talk we will introduce generalisations of this map and explore
their combinatorial properties.