Related papers: Logarithms of Catalan generating functions: A comb…
In recent preprints, Cigler considered certain Hankel determinants of convoluted Catalan numbers and conjectured identities for these determinants. In this note, we shall give a bijective proof of Cigler's Conjecture by interpreting…
Following our earlier work, where doubly indexed and irreducible over Q two-variable Laguerre polynomials were introduced, we prove for such polynomials some recurrence formulas and obtain a generating function. In addition, we show how…
When one tries to take into account the non-trivial vacuum structure of Quantum Field Theory, the standard functional-integral tools such as generating functionals or transitional amplitudes, are often quite inadequate for such purposes.…
A linear chord diagram canonically determines a fatgraph and hence has an associated genus $g$. We compute the natural generating function ${\bf C}_g(z)=\sum_{n\geq 0} {\bf c}_g(n)z^n$ for the number ${\bf c}_g(n)$ of linear chord diagrams…
We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergne's generalization of a volume formula…
We propose formulas for the large $N$ expansion of the generating function of connected correlators of the $\beta$-deformed Gaussian and Wishart-Laguerre matrix models. We show that our proposal satisfies the known transformation properties…
In this paper, we study a generalization of Jacobsthal and Jacobsthal-Lucas numbers, we find their generating function binet formulas, related matrix representation and many other properties
We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.
We announce a series of results on the combinatorial study of the q-Catalan triangle (C_{n,k}(q)), defined by C_{n,0}(q)=q^{n(n-1)/2} and C_{n,k}(q)=C_{n,k-1}(q)+q^{n-k-1}C_{n-1,k}(q). We establish combinatorial interpretations via a…
We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…
We define the generalized Golomb triangular recursion by g_{j,s,lambda}(n) = g_{j,s,lambda}(n - s - g_{j,s,lambda}(n-j)) + \lambda j. For particular choices of the initial conditions, we show that the solution of the recursion is a non-slow…
Parking functions are a widely studied class of combinatorial objects, with connections to several branches of mathematics. On the algebraic side, parking functions can be identified with the standard monomials of $M_n$, a certain monomial…
A {\em k-generalized Dyck path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of horizontal-steps $(k, 0)$ for a given integer $k\geq 0$, up-steps $(1,1)$, and…
In this note, we present a simple summation formula for $k$-bonacci numbers. The derivation consists in obtaining the generating function of such numbers, and noting that its evaluation at a particular value yields a formula generalizing a…
We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP.…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
We extend the notion of mex, which is central in combinatorial number theory, to an arbitrary combinatorial structure, and we prove a general theorem to determine the generating function of the objects having fixed mex. We then study this…
We consider a number of combinatorial problems in which rational generating functions may be obtained, whose denominators have factors with certain singularities. Specifically, there exist points near which one of the factors is asymptotic…
The paper describes a prime factorization of the Catalan numbers. Odd prime factors are distributed in layers in accordance with Legendre's formula. The content of each layer is a network of the intervals, Chebyshev's Segments. The primes…
We will look at the Catalan numbers from the {\it Rigged Configurations} point of view originated \cite{Kir} from an combinatorial analysis of the Bethe Ansatz Equations associated with the higher spin anisotropic Heisenberg models . Our…