An involution on (1,0)-trees
From MaRDI portal
Abstract: In [Decompositions and statistics for �eta(1,0)-trees and nonseparable permutations, Advances Appl. Math. 42 (2009) 313--328] we introduced an involution, h, on �eta(1,0)-trees. We neglected, however, to prove that h indeed is an involution. In this note we provide the missing proof. We also refine an equidistribution result given in the same paper.
Recommendations
- Enumeration of fixed points of an involution on \(\beta(1,0)\)-trees
- An involution on bicubic maps and \beta(0,1)-trees
- An involution on increasing trees
- Enumeration of trees by inversions
- Comment on ``A note on the distribution of the three types of nodes in uniform binary trees by Helmut Prodinger
Cites work
Cited in
(6)- The rise-contact involution on Tamari intervals
- Enumeration of fixed points of an involution on \(\beta(1,0)\)-trees
- An involution on bicubic maps and \beta(0,1)-trees
- Two involutions on binary trees and generalizations
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
- A trinity of duality: non-separable planar maps, \(\beta(1,0)\)-trees and synchronized intervals
This page was built for publication: An involution on \(\beta (1,0)\)-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394804)