Meanders and Dyck-Path Billiards
Preprint
Abstract
We study a statistic $\mathsf{traj}$ on the ordered pairs $(P,Q)$ of Dyck paths of size $n$, which counts the number of billiard trajectories in the grid polygon enclosed by $P$ and $-Q$, where $-Q$ is the path obtained by reflecting $Q$ over the ground line. It turns out to coincide with the component statistic of meanders. In terms of grid polygon, we establish an involution on the set of such ordered pairs $(P,Q)$ which either increases or decreases $\mathsf{traj}(P,Q)$ by 1. This proves a result by Di Francesco--Golinelli--Guitter that the numbers of semimeanders (meanders, respectively) of order $n$ with even and odd numbers of components are equal if $n$ is even and differ by a Catalan number (the square of a Catalan number, respectively) if $n$ is odd. Some results about $(-1)$-evaluation of the generating functions for the statistic $\mathsf{traj}$ on restricted sets of Dyck paths are also presented.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Spanning hypertrees, vertex tours and meandersEuropean Journal of Combinatorics, 2023
- Meanders: A personal perspective to the memory of Pierre RosenstiehlEuropean Journal of Combinatorics, 2023
- The on-line encyclopedia of integer sequencesNotices of the American Mathematical Society, 2018
- Connected components of meanders: Ⅰ. bi-rainbow meandersDiscrete and Continuous Dynamical Systems, 2017
- Rainbow meanders and Cartesian billiardsSão Paulo Journal of Mathematical Sciences, 2012
- Meander, folding, and arch statisticsMathematical and Computer Modelling, 1997
- Meanders: a direct enumeration approachNuclear Physics B, 1996