Related papers: Combinatorics of the three-parameter PASEP partiti…
In this paper we find explicit formulas for: (1) Green's function for a system of one-dimensional bosons interacting via a delta-function potential with particles confined to the positive half-line; and (2) the transition probability for…
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…
We demonstrate that statistics of certain classes of set partitions is described by generating functions related to the Burgers, Ibragimov--Shabat and Korteweg--de Vries integrable hierarchies.
In this paper, we give a purely bijective proof that two different partition classes that are both combinatorial interpretations of the partition function $p_\nu(n)$, a partition function related to the third order mock theta function…
Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…
In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…
We prove an identity about partitions involving new combinatorial coefficients. The proof given is using a generating function. As an application we obtain the explicit expression of two shifted symmetric functions, related with Jack…
We investigate a balance network of the asymmetric simple exclusion process (ASEP). Subsystems consisting of ASEPs are connected by bidirectional links with each other, which results in balance between every pair of subsystems. The network…
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods…
We consider a two-component asymmetric simple exclusion process (ASEP) on a finite lattice with reflecting boundary conditions. For this process, which is equivalent to the ASEP with second-class particles, we construct the representation…
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…
In previous work, the first and third authors introduced staircase tableaux, which they used to give combinatorial formulas for the stationary distribution of the asymmetric simple exclusion process (ASEP) and for the moments of the…
The refined enumeration of alternating sign matrices (ASMs) of given order having prescribed behavior near one or more of their boundary edges has been the subject of extensive study, starting with the Refined Alternating Sign Matrix…
The elementary symmetric partition function is a map on the set of partitions. It sends a partition lambda to the partition whose parts are the summands in the evaluation of the elementary symmetric function on the parts of lambda. These…
In this paper we revisit the work of E.T. Bell concerning partition polynomials in order to introduce the reciprocal partition polynomials. We give their explicit formulas and apply the result to compute closed formulae for some well-known…
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…
In these expository notes, we describe some features of the multiplicative coalescent and its connection with random graphs and minimum spanning trees. We use Pitman's proof of Cayley's formula, which proceeds via a calculation of the…
We introduce the notion of arithmetic progression blocks or AP-blocks of $\mathbb{Z}_n$, which can be represented as sequences of the form $(x, x+m, x+2m, ..., x+(i-1)m) \pmod n$. Then we consider the problem of partitioning $\mathbb{Z}_n$…
A loop series expansion for the partition function of a general statistical model on a graph is carried out. If the auxiliary probability distributions of the expansion are chosen to be a fixed point of the belief-propagation equation, the…
The partition functions of Pasquier models on the cylinder, and the associated intertwiners, are considered. It is shown that earlier results due to Saleur and Bauer can be rephrased in a geometrical way, reminiscent of formulae found in…