A bijection for partitions with all ranks at least \(t\)

DOI10.1006/jcta.1998.2873zbMath0914.05003OpenAlexW1966143260MaRDI QIDQ1269891

Sylvie Corteel, Carla D. Savage, Radhika Venkatraman

Publication date: 21 June 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1998.2873

zbMATH Keywords

generating functionsRogers-Ramanujan identitiesset partitionsdegree sequenceDurfee squareFerrers diagramgraphical partitionsDurfee rectangle

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Special sequences and polynomials (11B83) Graph theory (05C99)

Related Items (1)

Mahonian pairs

Cites Work

• Unnamed Item
• Extension of the partition sieve
• A correspondence between partitions related to generalizations of the Rogers-Ramanujan identities
• On the difference of successive Gaussian polynomials
• A recurrence for counting graphical partitions
• A note on graphical partitions
• Nonnegativity results for generalized \(q\)-binomial coefficients
• On graphical partitions
• Enumeration of plane partitions
• Some remarks on two- and three-line partitions
• The q-log-concavity of q-binomial coefficients
• A Unimodality Result in the Enumeration of Subgroups of a Finite Abelian Group
• A NOTE ON RANKS AND CONJUGACY OF PARTITIONS
• SOME ASYMPTOTIC FORMULAE IN THE THEORY OF PARTITIONS

This page was built for publication: A bijection for partitions with all ranks at least \(t\)