Dyson's new symmetry and generalized Rogers-Ramanujan identities
Cilanne Boulet
Abstract
We present a generalization, which we call (k,m)-rank, of Dyson's notion of rank to integer partitions with k successive Durfee rectangles and give two combinatorial symmetries associated with this new definition. We prove these symmetries bijectively. Using the two symmetries we give a new combinatorial proof of generalized Roger-Ramanujan identities. We also describe the relationship between (k,m)-rank and Garvan's k-rank.
Create a lesson
Related papers
Maximal anti-Ramsey problems for posets
Binlong Li, Balázs Patkós, Changxin Wang
An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision
Douglas M. Chen
Perfect state transfer on Cayley graphs over dihedral groups: A complete and practical characterization
Shixin Wang
An Improvement to the Upper Bound for Marton's Covering Conjecture
Zhao Song, Song Yue
Vertex-transitive strongly regular graphs in the switching class of doubly transitive two-graphs
Robert F. Bailey, Gábor P. Nagy, Valentino Smaldore
Inversion-descent enumerators of 321-avoiding permutations
Qiongqiong Pan