Method for constructing bijections for classical partition identities

DOI10.1073/PNAS.78.4.2026MaRDI QIDQ3914993zbMATH OpenOpenAlexWikidataFDO

Authors 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

bijectionsinvolutionsRogers-Ramanujan identities

Mathematics Subject Classification ID

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

Cited in

(32)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3914993)