Related papers: The Catalan simplicial set
The Catalan simplicial set $\mathbb{C}$ is known to classify skew-monoidal categories in the sense that a map from $\mathbb{C}$ to a suitably defined nerve of $\mathrm{Cat}$ is precisely a skew-monoidal category \cite{Catalan1}. We extend…
Many monoidal-type objects are known to be classified by maps from the Catalan simplicial set $\mathbb{C}$ to various nerves of categories and higher categories. There are, for example, three different nerves of the 2-category of categories…
In "Square partitions and Catalan numbers" (arXiv0912.4983), Bennett et al. presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a…
A Catalan pair is a pair of binary relations (S,R) satisfying certain axioms. These objects are enumerated by the well-known Catalan numbers, and have been introduced with the aim of giving a common language to most of the structures…
Motivated by representation theory we exhibit an interior structure to Catalan sequences and many generalisations thereof. Certain of these coincide with well known (but heretofore isolated) structures. The remainder are new.
Although multiplier bimonoids in general are not known to correspond to comonoids in any monoidal category, we classify them in terms of maps from the Catalan simplicial set to another suitable simplicial set; thus they can be regarded as…
The basic data for a skew-monoidal category are the same as for a monoidal category, except that the constraint morphisms are no longer required to be invertible. The constraints are given a specific orientation and satisfy Mac Lane's five…
A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.
We define the notion of a Catalan pair (which is a pair of binary relations (S,R) satisfying certain axioms) with the aim of giving a common language to most of the combinatorial interpretations of Catalan numbers. We show, in particular,…
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these problems.
We describe arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects specified as a Haskell type class. Our algorithms work on a {\em generic} representation that we illustrate on…
In this paper we determine the parity of some sequences which are related to Catalan numbers. Also we introduce a combinatorical object called, \Catalan tree", and discuss its properties.
We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…
In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…
In this paper, we introduce two differential equations arising from the generating function of the Catalan numbers which are `inverses' to each other in some sense. From these differential equations, we obtain some new and explicit…
Using generalized binomial coefficient identities and some results of John Dougall, we derive some families of series involving the cubes of Catalan numbers. We also establish a family of series containing fourth powers of Catalan numbers.…
In this (mostly expository) paper I want to share some observations prompted by a class of matrices whose determinants are Catalan numbers. Considering different methods of proof we obtain some generalizations and q-analogues and…
We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared…
We introduce a transformation of finite integer sequences, show that every sequence eventually stabilizes under this transformation and that the number of fixed points is counted by the Catalan numbers. The sequences that are fixed are…
The Catalan numbers (C_n)_{n >= 0} = 1,1,2,5,14,42,... form one of the most venerable sequences in combinatorics. They have many combinatorial interpretations, from counting bracketings of products in non-associative algebra to counting…