On Weighted and Bounded Multidimensional Catalan Numbers
Ryota Inagaki, Dimana Pramatarova
TL;DR
This work introduces a weighted framework for multidimensional Catalan numbers via Balanced ballot paths in $k$ dimensions, using a height statistic to define bounded and weighted variants. It develops matrix-based recurrences for weighted 2D Catalan numbers and extends these ideas to higher dimensions, establishing periodicity criteria modulo an integer through finite-state transitions. The authors construct two new families of arrays: the $k$-dimensional Balanced-ballot-path-height triangles and a multidimensional Narayana triangle, providing recursive formulas, explicit counts, and tables for low-dimensional cases, along with data-driven observations and code to compute them. The results offer both theoretical insight into the structure of multidimensional Catalan-type enumerations and practical tools for exploring height- and peak-based statistics in higher-dimensional lattice paths, with potential connections to Standard Young Tableaux and related combinatorial objects.
Abstract
We define a weighted analog for the multidimensional Catalan numbers, obtain matrix-based recurrences for some of them, and give conditions under which they are periodic. Building on this framework, we introduce two new sequences of triangular arrays: the first one enumerates the $k$-dimensional Balanced ballot paths of exact height $s$; the second one is a new multidimensional generalization of the Narayana numbers, which count the number of Balanced ballot paths with exactly $p$ peaks.
