English

Modular Fuss-Catalan numbers

Combinatorics 2020-07-03 v1

Abstract

The modular Catalan numbers Ck,nC_{k,n}, introduced by Hein and Huang in 2016 count equivalence classes of parenthesizations of x0x1xnx_0 * x_1 * \dots *x_n where * is a binary kk-associative operation and kk is a positive integer. The classical notion of associativity is just 1-associativity, in which case C1,n=1C_{1,n} = 1 and the size of the unique class is given by the Catalan number CnC_n. In this paper we introduce modular Fuss-Catalan numbers Ck,nmC_{k,n}^{m} which count equivalence classes of parenthesizations of x0x1xnx_0 * x_1 * \dots *x_n where * is an mm-ary kk-associative operation for m2m \geq 2. Our main results are a closed formula for Ck,nmC_{k,n}^{m} and a characterisation of kk-associativity.

Cite

@article{arxiv.2007.00718,
  title  = {Modular Fuss-Catalan numbers},
  author = {Dixy Msapato},
  journal= {arXiv preprint arXiv:2007.00718},
  year   = {2020}
}
R2 v1 2026-06-23T16:46:53.979Z