Modular Catalan numbers

From MaRDI portal
Publication:730265

DOI10.1016/J.EJC.2016.11.004zbMATH Open1352.05015arXiv1508.01688OpenAlexW2962862310MaRDI QIDQ730265FDOQ730265

Nickolas Hein, Jia Huang

Publication date: 27 December 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: The Catalan number Cn enumerates parenthesizations of x0*dotsb*xn where * is a binary operation. We introduce the modular Catalan number Ck,n to count equivalence classes of parenthesizations of x0*dotsb*xn when * satisfies a k-associative law generalizing the usual associativity. This leads to a study of restricted families of Catalan objects enumerated by Ck,n with emphasis on binary trees, plane trees, and Dyck paths, each avoiding certain patterns. We give closed formulas for Ck,n with two different proofs. For each nge0 we compute the largest size of k-associative equivalence classes and show that the number of classes with this size is a Catalan number.


Full work available at URL: https://arxiv.org/abs/1508.01688





Cites Work


Cited In (13)

Uses Software






This page was built for publication: Modular Catalan numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730265)