English

Multivariate Fuss-Catalan numbers

Combinatorics 2008-11-03 v1

Abstract

Catalan numbers C(n)=1n+1(2nn)C(n)=\frac{1}{n+1}{2n\choose n} enumerate binary trees and Dyck paths. The distribution of paths with respect to their number kk of factors is given by ballot numbers B(n,k)=nkn+k(n+kn)B(n,k)=\frac{n-k}{n+k}{n+k\choose n}. These integers are known to satisfy simple recurrence, which may be visualised in a ``Catalan triangle'', a lower-triangular two-dimensional array. It is surprising that the extension of this construction to 3 dimensions generates integers B3(n,k,l)B_3(n,k,l) that give a 2-parameter distribution of C3(n)=12n+1(3nn)C_3(n)=\frac 1 {2n+1} {3n\choose n}, which may be called order-3 Fuss-Catalan numbers, and enumerate ternary trees. The aim of this paper is a study of these integers B3(n,k,l)B_3(n,k,l). We obtain an explicit formula and a description in terms of trees and paths. Finally, we extend our construction to pp-dimensional arrays, and in this case we obtain a (p1)(p-1)-parameter distribution of Cp(n)=1(p1)n+1(pnn)C_p(n)=\frac 1 {(p-1)n+1} {pn\choose n}, the number of pp-ary trees.

Keywords

Cite

@article{arxiv.0711.0906,
  title  = {Multivariate Fuss-Catalan numbers},
  author = {Jean-Christophe Aval},
  journal= {arXiv preprint arXiv:0711.0906},
  year   = {2008}
}
R2 v1 2026-06-21T09:40:25.443Z