A Rogers-Ramanujan bijection
From MaRDI portal
Publication:1160129
DOI10.1016/0097-3165(81)90062-5zbMath0477.05009MaRDI QIDQ1160129
Stephen C. Milne, Adriano M. Garsia
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
05A15: Exact enumeration problems, generating functions
05A17: Combinatorial aspects of partitions of integers
11P81: Elementary theory of partitions
Related Items
A bijection proving orthogonality of the characters of \(S_ n\), Garsia and Milne's bijective proof of the inclusion-exclusion principle, A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof, Hybrid tableaux and the Littlewood-Richardson rule, Partition bijections, a survey, Geometry and complexity of O'Hara's algorithm, A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries, A Schensted algorithm for rim hook tableaux, Binomial determinants, paths, and hook length formulae, Catalan numbers, \(q\)-Catalan numbers and hypergeometric series, Bijective proofs of basic hypergeometric series identities, Bijections for partition identities, A combinatorial proof of the Giambelli identity for Schur functions, Problems on the Z-statistic, A short Rogers-Ramanujan bijection, Bijective proofs of some classical partition identities, An injection for the Ehrenpreis Rogers-Ramanujan problem, Descent classes of permutations with a given number of fixed points, The ranks of partitions modulo 2, Particle seas and basic hypergeometric series., Sieve-equivalence and explicit bijections, Sieve equivalence in generalized partition theory, Sinks in acyclic orientations of graphs, The nature of partition bijections. I: Involutions, A combinatorial proof of the equivalence of the classical and combinatorial definitions of Schur function, Variants of the Rogers-Ramanujan identities, Bijective matrix algebra, A combinatorial proof of the Rogers--Ramanujan and Schur identities, A bijective proof of the generating function for the number of reverse plane partitions via lattice paths
Cites Work
- Bijective proofs of some classical partition identities
- A combinational proof of the Mehler formula
- A Combinatorial Generalization of the Rogers-Ramanujan Identities
- Method for constructing bijections for classical partition identities
- On the Geometry of Numbers in Elementary Number Theory
- On Estimates in Number Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
