Non-crossing trees, quadrangular dissections, ternary trees, and duality-preserving bijections
From MaRDI portal
Publication:2033473
DOI10.1007/s00026-021-00531-wzbMath1466.05096arXiv1807.11602OpenAlexW3156519193MaRDI QIDQ2033473
Publication date: 17 June 2021
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.11602
ternary treesquadrangular dissectionsflagged perfectly chain decomposed ditreesproperly embedded graphsunlabeled non-crossing trees
Trees (05C05) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (2)
The positive geometry for \(\varphi^p\) interactions ⋮ Trajectories in random minimal transposition factorizations
Uses Software
Cites Work
- Positivity for cluster algebras from surfaces
- Chords, trees and permutations
- Short factorizations of permutations into transpositions
- Some remarks on Catalan families
- A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
- Catalan numbers, their generalization, and their uses
- On the cell-growth problem for arbitrary polygons
- Enumeration of noncrossing trees on a circle
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- Random planar lattices and integrated superBrownian excursion
- Polygon dissections and Euler, Fuss, Kirkman, and Cayley numbers
- Diagonally convex directed polyominoes and even trees: A bijection and related issues
- The cyclic sieving phenomenon
- Dihedral sieving phenomena
- Generating linear extensions of posets by transpositions
- The cyclic sieving phenomenon for faces of generalized cluster complexes
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Non-crossing trees, quadrangular dissections, ternary trees, and duality-preserving bijections
