An involution on (1,0)-trees

DOI10.1016/J.AAM.2013.04.002zbMATH Open1280.05003arXiv1210.1608OpenAlexW1782244419MaRDI QIDQ394804FDOQ394804

Authors: Anders Claesson, Sergey Kitaev, Einar Steingrímsson 

Publication date: 27 January 2014

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

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.

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

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

zbMATH Keywords

involutionequidistribution\(\beta (1,0)\)-treenonseparable permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19)

Cites Work

• A bijective census of nonseparable planar maps
• Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations

Cited In (6)

• The rise-contact involution on Tamari intervals
• An involution on bicubic maps and \beta(0,1)-trees
• Enumeration of fixed points of an involution on \(\beta(1,0)\)-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)