English

Meanders and Dyck-Path Billiards

Combinatorics 2025-09-24 v1

Abstract

We study a statistic traj\mathsf{traj} on the ordered pairs (P,Q)(P,Q) of Dyck paths of size nn, which counts the number of billiard trajectories in the grid polygon enclosed by PP and Q-Q, where Q-Q is the path obtained by reflecting QQ 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)(P,Q) which either increases or decreases traj(P,Q)\mathsf{traj}(P,Q) by 1. This proves a result by Di Francesco--Golinelli--Guitter that the numbers of semimeanders (meanders, respectively) of order nn with even and odd numbers of components are equal if nn is even and differ by a Catalan number (the square of a Catalan number, respectively) if nn is odd. Some results about (1)(-1)-evaluation of the generating functions for the statistic traj\mathsf{traj} on restricted sets of Dyck paths are also presented.

Keywords

Cite

@article{arxiv.2509.18981,
  title  = {Meanders and Dyck-Path Billiards},
  author = {Sen-Peng Eu and Tung-Shan Fu and Hsiang-Chun Hsu},
  journal= {arXiv preprint arXiv:2509.18981},
  year   = {2025}
}

Comments

15 pages, 13 figures

R2 v1 2026-07-01T05:52:02.742Z