Related papers: Matrix Ansatz, lattice paths and rook placements
We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…
Our results can be viewed as applications of algebraic combinatorics in random matrix theory. These applications are motivated by the predictive power of random matrix theory for the statistical behavior of the celebrated Riemann…
The set of Dyck paths of length $2n$ inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution of two statistics for Dyck paths:…
Using a recursive approach, we show that the generating function for sets of Motzkin paths avoiding a single (not necessarily consecutive) pattern is rational over $x$ and the Catalan generating function $C(x) =…
For $\ell \geq 1$ and $k \geq 2$, we consider certain admissible sequences of $k-1$ lattice paths in a colored $\ell \times \ell$ square. We show that the number of such admissible sequences of lattice paths is given by the sum of squares…
In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…
Using loop equation technics, we compute all mixed traces correlation functions of the 2-matrix model to large N leading order. The solution turns out to be a sort of Bethe Ansatz, i.e. all correlation functions can be decomposed on…
In the first part of this paper I give an elementary overview about some number sequences which count various sorts of lattice paths in strips along the x-axis and compute their generating functions in terms of Fibonacci and Lucas…
We analyze the combinatorics behind the operation of taking the logarithm of the generating function $G_k$ for $k^\text{th}$ generalized Catalan numbers. We provide combinatorial interpretations in terms of lattice paths and in terms of…
The orbifold generalization of the partition function, which would describe the gauge theory on the ALE space, is investigated from the combinatorial perspective. It is shown that the root of unity limit of the q-deformed partition function…
We define a generalized vector partition function and derive an identity for generating series of such functions associated with solutions of basic recurrence relation of combinatorial analysis. As a consequence, we obtain the generating…
We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method,…
We determine the rank generating function, the zeta polynomial and the Moebius function for the poset NC^B(p,q) of annular non-crossing partitions of type B, where p and q are two positive integers. We give an alternative treatment of some…
In this paper, we establish a connection between Rogers-Ramanujan-Gordon type overpartitions to lattice paths with four kinds of unitary steps. By establishing the bijective relationship between overpartitions and lattice paths, we…
We study a class of observables in four-dimensional superconformal Yang--Mills theories which, in the planar limit at finite 't Hooft coupling, can be expressed as determinants of semi-infinite matrices built from Bessel functions. This…
Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…
We study combinatorial structures arising from finite-time transition probabilities of the Totally Asymmetric Simple Exclusion Process with open boundary conditions. While much of the existing combinatorial theory regarding the TASEP…
Generating functions for asymmetric step-size paths restricted by two absorbing barriers are derived. The method begins by applying the Lagrange inversion formula to arbitrary powers of roots of the characteristic equation, that being a…
The asymmetric simple exclusion process (ASEP) is a model for translation in protein synthesis and traffic flow; it can be defined as a Markov chain describing particles hopping on a one-dimensional lattice. In this article I give an…
Kim and Drake used generating functions to prove that the number of 2-distant noncrossing matchings, which are in bijection with little Schroeder paths, is the same as the weight of Dyck paths in which downsteps from even height have weight…