Heaps of pieces for lattice paths

Abstract

We study heaps of pieces for lattice paths, which give a combinatorial visualization of lattice paths. We introduce two types of heaps: type $I$ and type $II$. A heap of type $I$ is characterized by peaks of a lattice path. We have a duality between a lattice path $μ$ and its dual $\overlineμ$ on heaps of type $I$. A heap of type $II$ for $μ$ is characterized by the skew shape between the lowest path and $μ$. We give a determinant expression for the generating function of heaps for general lattice paths, and an explicit formula for rational $(1,k)$-Dyck paths by using the inversion lemma. We introduce and study heaps in $k+1$-dimensions which are bijective to heaps of type $II$ for $(1,k)$-Dyck paths. Further, we show a bijective correspondence between type $I$ and type $II$ in the case of rational $(1,k)$-Dyck paths. As another application of heaps, we give two explicit formulae for the generating function of heaps for symmetric Dyck paths in terms of statistics on Dyck paths and on symmetric Dyck paths respectively.

Figures (10)

• Figure 2.2: An example of a heap.
• Figure 3.2: Twelve heaps of type $I$ for $(1,2)$-Dyck paths and $n=2$.
• Figure 3.6: Heaps of type $I$ for $(2,1)$-Dyck paths of size $2$.
• Figure 4.1: A heap for the lattice path $D^3U^2DUD^2UDUDU^2$ below the path $UD^2U^2DUD^2UD^2U^2D$
• Figure 5.6: The correspondence among the lattice path, the heap, and the non-intersecting paths

Theorems & Definitions (82)

• Definition 2.1: Vie86
• Definition 2.3
• Proposition 2.4: Kra06
• Definition 3.1
• Definition 3.3
• Definition 3.4
• Definition 3.5
• Definition 3.7
• Proposition 3.8
• proof