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

DOI10.1007/S00373-013-1336-6MaRDI QIDQ742637zbMATH OpenOpenAlexFDO

Authors Sergey Kitaev, Anna de Mier

Publication date 19 September 2014

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.2618, https://strathprints.strath.ac.uk/53179/

zbMATH Keywords

description treesenumerationfixed pointsinvolutionplanar maps

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Trees (05C05)

Abstract: $$-trees provide a convenient description of rooted non-separable planar maps. The involution $h$ on $$-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.

Recommendations

• An involution on \(\beta (1,0)\)-trees
• An involution on bicubic maps and \beta(0,1)-trees
• A trinity of duality: non-separable planar maps, \(\beta(1,0)\)-trees and synchronized intervals
• Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations
• Restricted non-separable planar maps and some pattern avoiding permutations

Cites work

• A bijective census of nonseparable planar maps
• An involution on \(\beta (1,0)\)-trees
• Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations
• Description trees and Tutte formulas.
• Diagonally convex directed polyominoes and even trees: A bijection and related issues
• Enumeration of Non-Separable Planar Maps
• scientific article; zbMATH DE number 1151365 (Why is no real title available?)
• On the number of self-dual rooted maps
• Patterns in permutations and words.
• Restricted non-separable planar maps and some pattern avoiding permutations
• The On-Line Encyclopedia of Integer Sequences

Cited in

(4)

• The number of involutions with \(r\) fixed points and a long increasing subsequence
• A trinity of duality: non-separable planar maps, \(\beta(1,0)\)-trees and synchronized intervals
• An involution on \(\beta (1,0)\)-trees
• An involution on bicubic maps and \beta(0,1)-trees

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Enumeration of fixed points of 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 Q742637)