Bijective proofs of some classical partition identities
- 30 November 1982
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 33 (3) , 273-286
- https://doi.org/10.1016/0097-3165(82)90040-1
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A Bijective Proof of the Hook Formula for the Number of Column Strict Tableaux with Bounded EntriesEuropean Journal of Combinatorics, 1983
- Bijective proofs of formulae for the number of standard Yound tableauxLinear and Multilinear Algebra, 1982
- A Rogers-Ramanujan bijectionJournal of Combinatorial Theory, Series A, 1981
- PIE-sums: A combinatorial tool for partition theoryJournal of Combinatorial Theory, Series A, 1981
- String overlaps, pattern matching, and nontransitive gamesJournal of Combinatorial Theory, Series A, 1981
- Some sieves for partition theoryJournal of Combinatorial Theory, Series A, 1979