English

Involution $h$ on Catalan structures

Combinatorics 2026-07-07 v1

Abstract

We define an involution hh on Catalan structures through an abstract framework, prove an equidistribution theorem for four canonical statistics and present a generating function carrying these. This framework encompasses all combinatorial structures with a decomposition mirroring the first-return decomposition of Dyck paths. The fixed points of~hh are counted by Catalan numbers. Canonical bijections transport the equidistribution to eight well known concrete families, identifying the canonical statistics with native ones on each. In addition to its primary structure, each Catalan structure has a derived \emph{secondary structure}, and hh~interchanges primary and secondary structure. The involution factors as h=\rev\corev\revh = \rev \circ \corev \circ \rev, where \rev\rev and \corev\corev are two simpler involutions, and the composition M=h\revM = h \circ \rev coincides with Donaghey's automorphism on plane trees. This yields M1=\revM\revM^{-1} = \rev \circ M \circ \rev and a period theorem: Iterating the secondary structure construction produces a sequence that repeats with period equal to the order of~MM. It is an open problem to describe hh and the canonical statistics explicitly on most of the more than two hundred known families of Catalan structures.

Cite

@article{arxiv.2607.06247,
  title  = {Involution $h$ on Catalan structures},
  author = {Anders Claesson and Sergey Kitaev and Einar Steingrímsson and Lintong Wang},
  journal= {arXiv preprint arXiv:2607.06247},
  year   = {2026}
}