A translation method for finding combinatorial bijections

DOI10.1007/s00026-009-0024-yzbMath1229.05041OpenAlexW2042216900MaRDI QIDQ659801

Doron Zeilberger, Philip Matchett Wood

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-009-0024-y

zbMATH Keywords

combinatorial identitybijectionbijective proofMaple code

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (2)

Computer-assisted bijectification of Franel's recurrence ⋮ BijTools

Uses Software

• Maple
• PHIL
• Examples
• Fibonacci
• TransMethodZeck
• ZeckFibBijections

Cites Work

• A bijective proof of Cassini's Fibonacci identity
• A Rogers-Ramanujan bijection
• Method for constructing bijections for classical partition identities
• Unnamed Item
• Unnamed Item

This page was built for publication: A translation method for finding combinatorial bijections