Refined Lattice Path Enumeration and Combinatorial Reciprocity

TL;DR

This paper provides exact enumeration formulas for specific classes of m-Dyck paths, linking them to combinatorial reciprocity, hyperplane arrangements, and recent algebraic structures, advancing understanding of lattice path combinatorics.

Contribution

It introduces new enumeration formulas for m-Dyck paths with constraints and connects these to combinatorial reciprocity and algebraic structures.

Findings

Exact formulas for paths with fixed height and valleys

Combinatorial realization of the H-triangle in noncrossing partitions

Explicit formula for the F-triangle via transformation

Abstract

It is well known that the set of $m$-Dyck paths with a fixed height and a fixed amount of valleys is counted by the Fu{\ss}-Narayana numbers. In this article, we consider the set of $m$-Dyck paths that start with at least $t$ north steps. We give exact formulas for the number of such paths with fixed height, fixed number of returns and (i) fixed number of valleys, (ii) fixed number of valleys with $x$-coordinate divisible by $m$ and (iii) fixed number of valleys with $x$-coordinate not divisible by $m$. The enumeration (ii) combinatorially realizes the $H$-triangle appearing in a recent article of Krattenthaler and the first author (Algebr. Comb. 5, 2022) in the context of certain parabolic noncrossing partitions. Through a transformation formula due to Chapoton, we give an explicit formula for the associated $F$-triangle. We realize this polynomial combinatorially by means of generalized Schr\"oder paths as well as flats in certain hyperplane arrangements. Along the way we exhibit two new combinatorial reciprocity results.