Some Observations on Dyson's New Symmetries of Partitions
Alexander Berkovich, Frank G. Garvan
Abstract
We utilize Dyson's concept of the adjoint of a partition to derive an infinite family of new polynomial analogues of Euler's Pentagonal Number Theorem. We streamline Dyson's bijection relating partitions with crank <= k and those with k in the Rank-Set of partitions. Also, we extend Dyson's adjoint of a partition to MacMahon's ``modular'' partitions with modulus 2. This way we find a new combinatorial proof of Gauss's famous identity. We give a direct combinatorial proof that for n>1 the partitions of n with crank k are equinumerous with partitions of n with crank -k.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.