Method for constructing bijections for classical partition identities

DOI10.1073/pnas.78.4.2026zbMath0464.05007OpenAlexW1980866929WikidataQ35339350 ScholiaQ35339350MaRDI QIDQ3914993

Stephen C. Milne, Adriano M. Garsia

Publication date: 1981

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.78.4.2026

zbMATH Keywords

involutionsRogers-Ramanujan identitiesbijections

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Related Items (30)

Finding direct partition bijections by two-directional rewriting techniques ⋮ Bijections on \(m\)-level rook placements ⋮ Topological strings, quiver varieties, and Rogers-Ramanujan identities ⋮ Bijections related to statistics on words ⋮ Bijective proofs of basic hypergeometric series identities ⋮ A bijection between Proctor's and Sundaram's odd orthogonal tableaux ⋮ Seven trees in one ⋮ The mysterious story of square ice, piles of cubes, and bijections ⋮ An involution for Jacobi's identity ⋮ The two-way rewriting in action: removing the mystery of Euler-Glaisher's map ⋮ Computer-assisted bijectification of Franel's recurrence ⋮ The relation between alternating sign matrices and descending plane partitions: \(n + 3\) pairs of equivalent statistics ⋮ Signed enumeration of ribbon tableaux: an approach through growth diagrams ⋮ A Rogers-Ramanujan bijection ⋮ A short Rogers-Ramanujan bijection ⋮ Lewis Carroll and the red hot potato: a graph theoretic approach to a linear algebraic identity ⋮ Partitions with part difference conditions and Bressoud's conjecture ⋮ Variants of the Rogers-Ramanujan identities ⋮ Multiset rewriting over Fibonacci and tribonacci numbers ⋮ A translation method for finding combinatorial bijections ⋮ A game semantics for linear logic ⋮ On a conjectured formula for quiver varieties ⋮ Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff conference on ordered sets ⋮ Bijective matrix algebra ⋮ Geometry and complexity of O'Hara's algorithm ⋮ Another involution principle-free bijective proof of Stanley's hook-content formula ⋮ Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences ⋮ Generalized Rogers-Ramanujan bijections ⋮ Computations versus bijections for tiling enumeration ⋮ An easy proof of the Rogers-Ramanujan identities

This page was built for publication: Method for constructing bijections for classical partition identities