Symmetric Dyck Paths in Catalan Combinatorics

• Symmetric Dyck paths are lattice paths that remain unchanged when reflected at their midpoint, exemplifying Catalan symmetry and combinatorial structure.
• They are exactly enumerated by binomial coefficients and connected to ballot sequences and q-Narayana numbers, yielding precise combinatorial counts.
• Their study supports bijective proofs and refined statistics on peaks and valleys, bridging complex algebraic and combinatorial theories.

A symmetric Dyck path is a classical Dyck path invariant under reflection about its midpoint—formally, the involution mapping each step at position $i$ to the conjugate step at position $2n - i + 1$, with $U \leftrightarrow D$. These objects form a central subclass of the Catalan family, appearing naturally in numerous enumerative, algebraic, and combinatorial contexts. Their structure leads to deep connections with ballot sequences, q-Narayana polynomials at $q=-1$, bijective coding via Dyck numbers, and the explicit study of intrinsic statistics such as valleys and peaks.

1. Formal Definitions and Symmetry Characterizations

Let $n\geq 0$. A Dyck path of semilength $n$ is a lattice path from $(0,0)$ to $(2n,0)$, never dipping below the $x$-axis, and composed of steps $U=(1,1)$ (up) and $2n - i + 1$0 (down). Encoded as Dyck words over $2n - i + 1$1 or $2n - i + 1$2, such paths correspond bijectively to Catalan objects.

A Dyck path is symmetric if it is invariant under the reflection mapping across the vertical line $2n - i + 1$3. In step language, this requires

$2n - i + 1$4

where $2n - i + 1$5 and $2n - i + 1$6 (Eremin, 2023). In terms of the height sequence $2n - i + 1$7, symmetry requires that $2n - i + 1$8 for $2n - i + 1$9 (Cigler, 13 Jan 2026).

When Dyck paths are encoded as binary strings replacing $U \leftrightarrow D$0 with $U \leftrightarrow D$1 and $U \leftrightarrow D$2 with $U \leftrightarrow D$3, a Dyck path is symmetric iff the (stripped) binary representation is palindromic under the map $U \leftrightarrow D$4, where $U \leftrightarrow D$5 is the bit-length after leading zeros are removed (Eremin, 2023).

2. Enumeration and Generating Functions

The total number $U \leftrightarrow D$6 of symmetric Dyck paths of semilength $U \leftrightarrow D$7 is

$U \leftrightarrow D$8

This follows from a bijection with ballot paths of length $U \leftrightarrow D$9, as established via classical reflection principles and explicitly by Eremin (Eremin, 2023, Cigler, 13 Jan 2026).

The generating function for $q=-1$0 splits into even and odd components: $q=-1$1

The $q=-1$2-Narayana numbers $q=-1$3, which enumerate Dyck paths of semilength $q=-1$4 with $q=-1$5 valleys, possess the remarkable property that evaluating at $q=-1$6 yields the distribution of symmetric Dyck paths by valley number: $q=-1$7 where $q=-1$8 is the number of symmetric Dyck paths of semilength $q=-1$9 with $n\geq 0$0 valleys (Cigler, 13 Jan 2026). In particular,

$n\geq 0$1

Closed forms for the valley distribution are given piecewise:

• For $n\geq 0$2: $n\geq 0$3
• For $n\geq 0$4: $n\geq 0$5

3. Binary Coding, Dyck Numbers, and Symmetric Bijections

Dyck paths can be encoded as positive integers called Dyck numbers (OEIS A036991), by writing the path in binary as described above and removing leading zeros. Symmetric Dyck numbers correspond to those whose binary forms are palindromic-complements.

A bijection $n\geq 0$6 maps any Dyck number $n\geq 0$7 to a unique symmetric Dyck number: $n\geq 0$8 where $n\geq 0$9, $n$0, and $n$1 is the bitwise complement of $n$2 (Eremin, 2023). Every asymmetric Dyck number serves as the root of an infinite unary "bijection tree" whose subsequent nodes are symmetric Dyck numbers, forming a forest structure.

Algorithms provided in (Eremin, 2023) test Dyckness, apply $n$3, test for symmetry, and generate these bijection forests.

4. Fine Statistics: Peaks, Valleys, and Weight Distributions

A rich structure emerges upon refining Dyck path statistics:

• A peak is an occurrence of $n$4, a valley $n$5.
• A peak (resp.\ valley) is symmetric if it lies within a maximal mountain (resp.\ valley) $n$6 (resp.\ $n$7) with $n$8; otherwise it is left- or right-asymmetric.

Enumerating symmetric peaks (and valleys) of weight $n$9 over all Dyck paths leads to refined generating functions. For symmetric peaks: $(0,0)$0 where $(0,0)$1 is the total over all $(0,0)$2 (Sun et al., 2021).

For symmetric valleys,

$(0,0)$3

with the aggregated generating function for symmetric valleys in $(0,0)$4 given by

$(0,0)$5

Elizalde's trivariate continued-fraction generating function encodes the joint distribution of symmetric and asymmetric peaks.

5. Bijective and Combinatorial Structures

Explicit bijections underpin the enumeration and classification of symmetric Dyck paths. The core bijection for symmetric peaks of weight $(0,0)$6 maps marked symmetric peaks to decompositions into free Dyck paths and partial Dyck paths of a given ending height (Sun et al., 2021). Analogous constructions enumerate valleys and asymmetric peaks/valleys, leveraging the inherent symmetry and reflection properties.

Further, in the Dyck number model, the map $(0,0)$7 and its inverse translate between arbitrary and symmetric Dyck numbers, generating connected components (bijection trees) with distinctive combinatorial interpretations (Eremin, 2023).

6. Connections with q-Narayana Theory and Ballot Paths

The relationship between symmetric Dyck paths and $(0,0)$8-Narayana numbers, specifically at $(0,0)$9, interlaces algebraic and enumerative combinatorics. The recurrence relations for $(2n,0)$0 mirror those arising from direct combinatorial decompositions of symmetric Dyck paths by valleys, leading to equidistribution (Cigler, 13 Jan 2026). The ballot path bijection explains the binomial enumeration, solidifying the bridge between path symmetry and ballot enumeration.

7. Extensions, Applications, and Significance

Symmetric Dyck paths and their refined statistics contribute intricate structure to Catalan combinatorics. They provide key cases in the study of rational Dyck paths (Dai et al., 26 Mar 2025), with applications in algebraic geometry (e.g., parking functions, rational Cherednik algebras), and representation theory.

Fine enumeration of symmetric peaks, valleys, and their weights refines longstanding Catalan results, inserting Riordan arrays and generating function theory into the framework (Sun et al., 2021). The bijection tree model offers algorithmic and computational handles for further exploration (Eremin, 2023). Finally, the equality $(2n,0)$1 synthesizes algebraic and combinatorial aspects in a unified theory (Cigler, 13 Jan 2026).