Enumeration of fixed points of an involution on β(1, 0)-trees

Sergey Kitaev, Anna de Mier

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)
65 Downloads (Pure)


β(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 languageEnglish
Pages (from-to)1207-1221
Number of pages15
JournalGraphs and Combinatorics
Issue number5
Early online date2 Jul 2013
Publication statusPublished - 1 Sept 2014


  • planar maps
  • description trees
  • fixed points
  • enumeration


Dive into the research topics of 'Enumeration of fixed points of an involution on β(1, 0)-trees'. Together they form a unique fingerprint.

Cite this