Two involutions on binary trees and generalizations

DOI10.1016/j.aam.2024.102677arXiv2309.06149OpenAlexW4391707346WikidataQ128179099 ScholiaQ128179099MaRDI QIDQ6199297

No author found.

Publication date: 21 March 2024

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2309.06149

zbMATH Keywords

involutionsbinary treesplane treesbijectionsrooted labeled treesweakly increasing trees

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Context-free grammars for permutations and increasing trees
• Old and young leaves on plane trees
• Combinatorial aspects of continued fractions
• On the diagram of 132-avoiding permutations
• Continued fractions and Catalan problems
• Counting with Borel's triangle
• Weakly increasing trees on a multiset
• Two bijections on weakly increasing trees
• A combinatorial bijection on di-sk trees
• The number of parking functions with center of a given length
• A symmetry on parking functions via Dyck paths
• Increasing trees and alternating permutations
• Catalan Numbers
• Permutations with restricted patterns and Dyck paths

This page was built for publication: Two involutions on binary trees and generalizations