Recursive bijections for Catalan objects

MaRDI QIDQ5404317zbMATH OpenFDO

Authors Stefan Forcey, Mohammadmehdi Kafashan, Mehdi Maleki, Michael C. Strayer

Publication date 24 March 2014

Full work available at URL https://arxiv.org/abs/1212.1188, http://www.emis.de/journals/JIS/VOL16/Forcey/forcey2.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

bijectionCatalan numbersrecursion

Mathematics Subject Classification ID

Trees (05C05) Combinatorial identities, bijective combinatorics (05A19)

Abstract: In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions posed by R. Stanley in the addendum to his textbook. We actually discuss two types of bijection, one defined recursively and the other defined in a more local, relative, fashion. It is interesting to compare the results of the two.

Recommendations

• scientific article; zbMATH DE number 1439427
• A new combinatorial identity for Catalan numbers.
• A bijection between certain non-crossing partitions and sequences
• Catalan structures and Catalan pairs
• The permuted analogues of three Catalan sets

Cited in

(4)

• Object grammars and bijections.
• Producing new bijections from old
• Catalan recursion on externally ordered bases of unit interval positroids
• A bijective study of basketball walks

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Recursive bijections for Catalan objects

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