Abstract
β(1, 0)-trees provide a convenient description of rooted non-separable planar maps. The involution h on β(1, 0)-trees was introduced to prove a complicated equidistribution result on a class of pattern-avoiding permutations. In this paper, we describe and enumerate fixed points of the involution h. Intriguingly, the fixed points are equinumerous with the fixed points under taking the dual map on rooted non-separable planar maps, even though the fixed points do not go to each other under the know (natural) bijection between the trees and the maps.
Original language | English |
---|---|
Pages (from-to) | 1207-1221 |
Number of pages | 15 |
Journal | Graphs and Combinatorics |
Volume | 30 |
Issue number | 5 |
Early online date | 2 Jul 2013 |
DOIs | |
Publication status | Published - 1 Sept 2014 |
Keywords
- planar maps
- description trees
- fixed points
- enumeration