Bijections for partition identities

DOI10.1016/0097-3165(88)90026-XzbMath0659.05005OpenAlexW1994661605MaRDI QIDQ1112027

Kathleen M. O'Hara

Publication date: 1988

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(88)90026-x

zbMATH Keywords

partition-identity bijections

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17)

Related Items (8)

Finding direct partition bijections by two-directional rewriting techniques ⋮ Partition bijections, a survey ⋮ The two-way rewriting in action: removing the mystery of Euler-Glaisher's map ⋮ Unnamed Item ⋮ Multiset rewriting over Fibonacci and tribonacci numbers ⋮ Geometry and complexity of O'Hara's algorithm ⋮ Limit Shapes via Bijections ⋮ \(q\)-analogues of Euler's odd = distinct theorem

Cites Work

• PIE-sums: A combinatorial tool for partition theory
• A Rogers-Ramanujan bijection
• Bijective proofs of some classical partition identities
• Sieve-equivalence and explicit bijections
• Sieve equivalence in generalized partition theory

This page was built for publication: Bijections for partition identities