A trinity of duality: non-separable planar maps, \(\beta(1,0)\)-trees and synchronized intervals
DOI10.1016/j.aam.2017.10.001zbMath1379.05001arXiv1703.02774OpenAlexW2681780651MaRDI QIDQ1693341
Publication date: 31 January 2018
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.02774
bijectionrecursive decomposition\(\beta-(1,0)\) treesmap dualitynon-separable planar mapssynchronized intervals
Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30)
Related Items (8)
Cites Work
- An involution on \(\beta (1,0)\)-trees
- Patterns in permutations and words.
- Enumeration of fixed points of an involution on \(\beta(1,0)\)-trees
- Intervals in Catalan lattices and realizers of triangulations
- Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations
- A bijective census of nonseparable planar maps
- Description trees and Tutte formulas.
- Permutations with forbidden subsequences and nonseparable planar maps
- On the number of self-dual rooted maps
- On the number of intervals in Tamari lattices
- Two bijections on Tamari intervals
- A Census of Planar Maps
- Counting smaller trees in the Tamari order
- The enumeration of generalized Tamari intervals
- The enumeration of generalized Tamari intervals
This page was built for publication: A trinity of duality: non-separable planar maps, \(\beta(1,0)\)-trees and synchronized intervals