A new generalization of the Narayana numbers inspired by linear operators on associative d-ary algebras
Abstract
We introduce and study a generalization of the Narayana numbers Nd(n,k) = 1n+1 n+1k+1 n + (n-k)(d-2)+1k for integers d ≥ 2 and n,k ≥ 0. This two-parameter array extends the classical Narayana numbers (d=2) and yields a d-ary analogue of the Catalan numbers Cd(n) = Σk=0n Nd(n,k). We give nine combinatorial interpretations of Nd(n,k) that unify and generalize known combinatorial interpretations of the Narayana numbers and C3(n) in the literature. In particular, we show that Nd(n,k) counts a natural class of operator monomials over a d-ary associative algebra, thereby extending a result of Bremner and Elgendy for the binary case. We also construct explicit bijections between these monomials and several families of classic combinatorial objects, including Schr\"oder paths, Dyck paths, rooted ordered trees, and 231-avoiding permutations.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.