Modular Catalan numbers

From MaRDI portal




Abstract: The Catalan number Cn enumerates parenthesizations of x0dotsbxn where is a binary operation. We introduce the modular Catalan number Ck,n to count equivalence classes of parenthesizations of x0dotsbxn 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.





Describes a project that uses

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)