Related papers: Catalan number sequences and generalized action gr…
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.
Two methods, structural (constructive) and multiplier (analytical), of exact enumeration of undirected and directed circulant graphs of orders 27 and 125 are elaborated and represented in detail here together with intermediate and final…
We introduce the three-Catalan triangle, highlighting the three-Catalan numbers along with their recurrence relation and combinatorial interpretation, which allows us to establish their log-convexity. Additionally, we prove that the rows of…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
The goal of this paper is to introduce and study noncommutative Catalan numbers $C_n$ which belong to the free Laurent polynomial algebra in $n$ generators. Our noncommutative numbers admit interesting (commutative and noncommutative)…
We revisit the concepts of acyclic orderings and number of acyclic orderings of acyclic digraphs in terms of dispositions and counters for arbitrary multidigraphs. We prove that when we add a sequence of nested directed paths to a directed…
We show that the cop number of directed and undirected Cayley graphs on abelian groups has an upper bound of the form of $O(\sqrt{n})$, where $n$ is the number of vertices, by introducing a refined inductive method. With our method, we…
We generalize the technique of linked cluster expansions on hypercubic lattices to actions that couple fields at lattice sites which are not nearest neighbours. We show that in this case the graphical expansion can be arranged in such a way…
This work is a continuation of some recent articles presenting enumerative results for Catalan words avoiding one or a pair of consecutive or classical patterns of length $3$. More precisely, we provide systematically the bivariate…
Catalan words are particular growth-restricted words counted by the eponymous integer sequence. In this article we consider Catalan words avoiding a pair of patterns of length 3, pursuing the recent initiating work of the first and last…
In the paper, with the aid of the series expansions of the square or cubic of the arcsine function, the authors establish several possibly new combinatorial identities containing the ratio of two central binomial coefficients which are…
We present an integral expression of the Catalan numbers, based on F\'eaux' integral representation of $\log\left[\Gamma(x)\right]$, $\Gamma$ being the usual Gamma function. The obtained formula may be the starting point of the derivation…
The Catalan numbers are well-known to be the answer to many different counting problems, and so there are many different families of sets whose cardinalities are the Catalan numbers. We show how such a family can be given the structure of a…
The main purpose of this note is to provide an elementary discussion of some simple triangles of integer numbers in particular through their connections with representation theory of $sl_2$. The triangles under consideration are the Catalan…
In type A, the q,t-Fuss -Catalan numbers can be defined as a bigraded Hilbert series of a module associated to the symmetric group S_n. We generalize this construction to (finite) complex reflection groups and exhibit some nice conjectured…
We study two classes of permutations intimately related to the visual proof of Spitzer's lemma and Huq's generalization of the Chung-Feller theorem. Both classes of permutations are counted by the Fuss-Catalan numbers. The study of one…
This paper is an introduction to the language of Feynman Diagrams. We use Reshetikhin-Turaev graphical calculus to define Feynman diagrams and prove that asymptotic expansions of Gaussian integrals can be written as a sum over a suitable…
In this article, we use the Touchard identity in order to obtain new integral representations for Catalan numbers. The main idea consists in combining the identity with a known integral representation and resorting to the binomial theorem.…
In this paper arithmetic progressions on the integers and the integers modulo n are extended to graphs. This allows for the definition of the anti-van der Waerden number of a graph. Much of the focus of this paper is on 3-term arithmetic…
In this (partly expository) paper we give a short overview about the close relationship between the sequence of Catalan numbers and Hankel determinants from the point of view of orthogonal polynomials and show that an analogous situation…