A Rogers-Ramanujan bijection

DOI10.1016/0097-3165(81)90062-5zbMath0477.05009OpenAlexW2030568854MaRDI QIDQ1160129

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0097-3165(81)90062-5

zbMATH Keywords

Rogers-Ramanujan identities Ferrers diagrams standard Young tableaux involution principle

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Related Items

Catalan numbers, $q$-Catalan numbers and hypergeometric series, The nature of partition bijections. I: Involutions, Bijective proofs of basic hypergeometric series identities, Partition bijections, a survey, The ranks of partitions modulo 2, A combinatorial proof of the equivalence of the classical and combinatorial definitions of Schur function, The mysterious story of square ice, piles of cubes, and bijections, Refinements of the Rogers–Ramanujan Identities, Bijections for partition identities, A combinatorial proof of the Giambelli identity for Schur functions, Problems on the Z-statistic, Generalisations of Capparelli's and Primc's identities. I: Coloured Frobenius partitions and combinatorial proofs, Effective Poset Inequalities, Bilateral identities of the Rogers–Ramanujan type, The relation between alternating sign matrices and descending plane partitions: $n + 3$ pairs of equivalent statistics, A bijective proof of the ASM theorem. I: The operator formula, Rogers-Ramanujan identities and the Robinson-Schensted-Knuth correspondence, Particle seas and basic hypergeometric series., The method of combinatorial telescoping, Signed enumeration of ribbon tableaux: an approach through growth diagrams, A short Rogers-Ramanujan bijection, Bijective proofs of some classical partition identities, Partitions with part difference conditions and Bressoud's conjecture, Variants of the Rogers-Ramanujan identities, A translation method for finding combinatorial bijections, A bijective proof of the generating function for the number of reverse plane partitions via lattice paths, Bijective matrix algebra, A combinatorial proof of the Rogers--Ramanujan and Schur identities, A bijective proof of the hook-length formula for skew shapes, Geometry and complexity of O'Hara's algorithm, Shift-plethystic trees and Rogers-Ramanujan identities, Bilateral Bailey lemma and Rogers-Ramanujan identities, The $A_2$ Rogers-Ramanujan identities revisited, THE JEU DE TAQUIN ON THE SHIFTED RIM HOOK TABLEAUX, Limit Shapes via Bijections, Sieve-equivalence and explicit bijections, Sieve equivalence in generalized partition theory, An injection for the Ehrenpreis Rogers-Ramanujan problem, Computations versus bijections for tiling enumeration, Weighted cylindric partitions, A bijection proving orthogonality of the characters of $S_ n$, A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries, Sinks in acyclic orientations of graphs, Garsia and Milne's bijective proof of the inclusion-exclusion principle, A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof, A Schensted algorithm for rim hook tableaux, Cylindric partitions and some new $A_2$ Rogers–Ramanujan identities, Binomial determinants, paths, and hook length formulae, Hybrid tableaux and the Littlewood-Richardson rule, Descent classes of permutations with a given number of fixed points

Cites Work