Łukasiewicz Paths & Plane Trees

• Łukasiewicz paths and plane trees are fundamental combinatorial objects defined by lattice path constraints and ordered tree structures.
• They are bijectively related via a depth-first traversal that maps up-steps and down-steps to tree nodes and leaves, preserving area and depth statistics.
• Generalizations using Young diagrams introduce λ-plane trees that yield refined enumeration formulas and reveal symmetry in q,t-Catalan statistics.

Łukasiewicz paths and plane trees are two fundamental classes of combinatorial objects with rich algebraic, probabilistic, and enumerative structures. The bijective correspondence between these structures underpins much of the modern combinatorics of lattice paths, tree enumerations, and $q,t$-Catalan statistics. This article rigorously defines both Łukasiewicz paths and plane trees, details the standard bijection between them, describes key combinatorial statistics, treats important algebraic and enumeration results, and surveys recent advancements generalizing these notions, notably in the context of statistics symmetry and Young diagram-parameterized generalizations.

1. Definitions and Basic Structures

Łukasiewicz paths are lattice paths in $\mathbb{Z}^2$ originating from $(0,0)$, using step set $\{U_k = (1,k): k \geq 0\} \cup \{D = (1,-1)\}$, and constrained to stay nonnegative in the $y$-coordinate except possibly at the final step, which must be a down-step $D$. The path of length $n$ is a sequence $P = (P_1, P_2, ..., P_n)$, with $h_i$ the height before step $P_i$.

Plane trees (rooted, ordered trees) are combinatorial trees whose nodes are ordered, distinguishing left and right siblings. A node with $k+1$ children corresponds to a $U_k$ up-step in the Łukasiewicz path; leaves correspond to down-steps $D$.

λ-plane trees generalize plane trees by imposing label and edge constraints derived from a self-conjugate Young diagram $\lambda$. Here, each vertex $v$ of the tree is assigned a label $c(v)$ in $\{1,2,\dots,\ell\}$ (for $\ell = \text{length}(\lambda)$), and every edge $\{u,v\}$ must satisfy $(c(u),c(v)) \in \lambda \subset \mathbb{N}^2$ (Bisi et al., 2024).

λ-Dyck paths are sequences of triples $((i_t, j_t, h_t))_{t=0}^{2k}$ in $\lambda \times \mathbb{N}$ such that $(h_t)$ forms a Dyck path (never negative, returns to zero), starting and ending at the same box $(i_0, j_0)$, and alternating between column and row moves on odd/even steps, with excursions required to begin and end at the same $(i,j)$.

2. Bijections Between Łukasiewicz Paths and Plane Trees

The classical bijection between Łukasiewicz paths and plane trees is realized via the contour walk/depth-first traversal encoding:

• Forward Direction (Tree $\to$ Path): Traverse the tree in depth-first order. On first visiting an internal node with out-degree $k+1$, record $U_k$; on visiting a leaf, record $D$. The collection of such steps produces the Łukasiewicz path associated with the tree (Fang, 25 Jan 2026).
• Reverse Direction (Path $\to$ Tree): Initialize a queue of "buds". For each step $P_i$ from left to right: if $P_i=U_k$, the leftmost bud is replaced by an internal node with $k+1$ new buds; if $P_i=D$, the leftmost bud is replaced by a leaf. This reconstructs the unique plane tree from the path.
• λ-plane trees and λ-Dyck paths are in bijection via an explicit encoding: the "contour walk" (with $\varepsilon_t = +1$ for child steps, $-1$ for parent steps and $h_t$ the Dyck heights), and position labels $(i_t, j_t)$ derived from the sequence of subtree visits and the coloring function $c(.)$, exploiting the self-conjugacy of $\lambda$ to guarantee well-posedness (Bisi et al., 2024).

3. Combinatorial Statistics: Area, Depth, and Thorns

Key statistics on Łukasiewicz paths and their connections to plane trees have emerged as central tools in $q,t$-Catalan combinatorics:

• Area($P$): The statistic $\mathrm{area}(P) = \sum_j h_{i_j}$, where $h_{i_j}$ are heights before each up-step $U_k$ (for ordered up-step positions $i_j$ in $P$) (Fang, 25 Jan 2026).
• Depth($P$): For each down-step $D$ (excluding the last), assign a label by matching to its associated up-step $U_k$ (first encountered under horizontal projection). The sum of these labels over all up-step positions defines $\mathrm{depth}(P)$.
• Tree translations: Internal nodes of the plane tree encode both statistics:
  • Right-thorns($u$): Number of descending edges from strict ancestors of $u$ that lie to the right of the path from the ancestor to $u$.
  • Left-thorns($u$): Analogous count to the left.
  • Exact correspondences: $\mathrm{Area}(P)_j = \mathit{rthorn}(u_j)$, $\mathrm{Depth}(P)_j = \mathit{lthorn}(u_j)$, so $\mathrm{area}(P) = \mathit{rthorn}(T)$, $\mathrm{depth}(P) = \mathit{lthorn}(T)$ (Fang, 25 Jan 2026).

The statistics have been shown to be equi-distributed over various families of Łukasiewicz or $\vec{k}$-Dyck paths (fixed up-step profile and endpoints), providing combinatorial symmetry in two variables for associated generating functions, a property previously conjectured and now established for general Łukasiewicz paths (Fang, 25 Jan 2026).

4. Enumeration and Algebraic Structure

Counting formulas and algebraic generating functions for the number of plane trees and corresponding paths are well-developed:

• Catalan and Generalizations: For $\lambda = (1,1)$ (the minimal case), one recovers the ordinary plane trees and Dyck paths, with counts given by the Catalan numbers $C_k$.
• For staircase shapes $\lambda = (r, r-1, ..., 1)$, the counts match the $r$-plane trees:

$C_k^{\lambda} = \frac{r}{k+1}\binom{(r+1)k}{k}$

• λ-plane trees/λ-Dyck paths: Let $C_k^{\lambda}$ be the count of such objects of size $k+1$; then the ordinary generating function $$M^{\lambda}(z) = \sum_{k\geq 0} C_k^{\lambda} z^{k+1}$$ satisfies a finite system of algebraic equations determined by the combinatorial structure of $\lambda$:

$$M_i = z + M_i(M_1 + \dots + M_{\lambda_i}), \text{ for } i = 1,\dots,\ell$$

and, in block form, $M^{\lambda}$ is algebraic of degree $r+1$ in $M$ and $r$ in $z$ where $r$ is the number of rectangular blocks in the Young diagram (Bisi et al., 2024).

The "Fat-Hook" Case

A particularly tractable regime is when $\lambda$ is a "fat hook": $\lambda = ((a_1+a_2)^{a_1}, a_1^{a_2})$.

• Closed formulas:

$$C_k^{\lambda} = C_k\, a_1^{k+1} \, {}_2F_1(-k-1, -k; k; a_2/a_1)$$

• The associated measure $F^{\lambda}$ has an explicit free-probabilistic description as an additive convolution of Marchenko–Pastur and Bernoulli measures, with R-transform and support provided in closed form (Bisi et al., 2024).

5. Symmetry and Involutions in Statistics

Recent work has illuminated deep symmetries in area and depth statistics beyond the classical Dyck regime:

• For any profile $M$ of up-step degrees, and fixed first/last up-step degrees $a$, $b$, the bivariate generating function

$$C_{a, M, b}(q, t) = \sum q^{\mathrm{area}(P)} t^{\mathrm{depth}(P)}$$

where the sum is over Łukasiewicz paths of the given type, is symmetric in $(q, t)$. The proof uniformly interprets both statistics and their exchange as natural involutions on trees (mirror, lodestar-swap) that preserve all other structural parameters but exchange left/right thorns (Fang, 25 Jan 2026).

• A key implication is the equi-distribution of $\mathrm{area}$ and $\mathrm{depth}$ over these families of paths and trees. This suggests robust symmetry phenomena extend well beyond classical Catalan structures.

6. Generalizations and Specializations

Several specializations and generalizations unify and extend the above frameworks:

• λ-plane tree/Dyck path reduction: For special Young diagrams, classical objects and their counts are recovered:
  • $\lambda = (1)$: Catalan objects.
  • Staircase cases: $r$-plane trees.
  • In all specializations, the bijection between plane trees and Dyck-type paths reduces to standard correspondences (Bisi et al., 2024).
• Vector and matrix parameterizations: The algebraic and enumerative frameworks accommodate multirectangular block structures in $\lambda$, with generating functions and master equations providing enumeration for very general parameter sets.
• A plausible implication is that these generalized statistics and enumerations offer a universal framework for the combinatorics of trees, lattice paths, and their free-probabilistic moments, with broad applications to random matrix theory and $q,t$-Catalan phenomena.

7. Examples and Corollaries

Explicit examples clarify the bijections and statistics:

Path $P$	Tree Structure Description	$\mathrm{area}(P)$	$\mathrm{depth}(P)$
$U_2\ D\ D\ U_1\ D$	Root degree 3, one internal child of degree 2, others leaves; internal's children are leaves	0	2

Area is computed as sum of heights before up-steps, depth as the sum of depth-labels matched under down-step assignment. Under the mirror and lodestar-swap involution, these statistics are exchanged, manifesting the $q,t$ symmetry (Fang, 25 Jan 2026).

Corollaries include equi-distribution results over finer path profiles, and reduction of results to special classical cases by summing over initial parameters.

---

Łukasiewicz paths, plane trees, and their generalizations via Young diagrams and associated statistics form a cohesive backbone for contemporary combinatorics, with their detailed algebraic, enumerative, and bijective structures providing the foundation for both theoretical insights and practical enumerative applications (Bisi et al., 2024, Fang, 25 Jan 2026).