50 citations · 148 across the 32 of their papers we have counts for
3 papers · 1 filter
An involution on β(1,0)-trees
Anders Claesson, Sergey Kitaev, Einar Steingrímsson
In [Decompositions and statistics for β(1,0)-trees and nonseparable permutations, Advances Appl. Math. 42 (2009) 313--328] we introduced an involution, h, on β(1,0)-trees. We negle…
An involution on bicubic maps and β(0,1)-trees
Anders Claesson, Sergey Kitaev, Anna de Mier
Bicubic maps are in bijection with β(0,1)-trees. We introduce two new ways of decomposing β(0,1)-trees. Using this we define an endofunction on β(0,1)-trees, and thus also on bicub…
Sorting and preimages of pattern classes
Anders Claesson, Henning Úlfarsson
We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description o…