Search arXivSearch

arXiv · 2511.13671

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 $N_d(n,k) = \frac{1}{n+1} \binom{n+1}{k+1} \binom{ n + (n-k)(d-2)+1}{k}$ for integers $d \geq 2$ and $n,k \geq 0$. This two-parameter array extends the classical Narayana numbers ($d=2$) and yields a $d$-ary analogue of the Catalan numbers $C_d(n) = \sum_{k=0}^n N_d(n,k)$. We give nine combinatorial interpretations of $N_d(n,k)$ that unify and generalize known combinatorial interpretations of the Narayana numbers and $C_3(n)$ in the literature. In particular, we show that $N_d(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öder paths, Dyck paths, rooted ordered trees, and $231$-avoiding permutations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yu Hin Au, Murray R. Bremner. 2025-12-09. A new generalization of the Narayana numbers inspired by linear operators on associative $d$-ary algebras. https://arxiv.org/abs/2511.13671

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO