A translation method for finding combinatorial bijections

DOI10.1007/S00026-009-0024-YzbMATH Open1229.05041OpenAlexW2042216900MaRDI QIDQ659801FDOQ659801

Authors: Philip Matchett Wood, Doron Zeilberger 

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

Recommendations

• A new approach for proving or generating combinatorial identities
• A variation on the method of Cartier and Foata via covering systems for combinatorial identities
• Partition identities and geometric bijections
• Bijections for partition identities
• Object grammars and bijections.

zbMATH Keywords

bijectioncombinatorial identitybijective proofMaple code

Mathematics Subject Classification ID

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

Cites Work

• Method for constructing bijections for classical partition identities
• Title not available (Why is that?)
• A Rogers-Ramanujan bijection
• A bijective proof of Cassini's Fibonacci identity
• Bijective proofs for Fibonacci identities related to Zeckendorf's theorem

Cited In (5)

• An application of the translational method
• Computer-assisted bijectification of Franel's recurrence
• The two-way rewriting in action: removing the mystery of Euler-Glaisher's map
• BijTools
• Finding direct partition bijections by two-directional rewriting techniques

Uses Software

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

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

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