Related papers: Combinatorics of the three-parameter PASEP partiti…
We propose a simple estimator that allows to calculate the absolute value of a system's partition function from a finite sampling of its canonical ensemble. The estimator utilizes a volume correction term to compensate the effect that the…
In this paper, we introduce the rhombic alternative tableaux, whose weight generating functions provide combinatorial formulae to compute the steady state probabilities of the two-species ASEP. In the ASEP, there are two species of…
The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for…
We review and present new studies on the relation between the partition functions of integrable lattice models and symmetric polynomials, and its combinatorial representation theory based on the correspondence, including our work. In…
In this paper, we consider nonparametric multidimensional finite mixture models and we are interested in the semiparametric estimation of the population weights. Here, the i.i.d. observations are assumed to have at least three components…
We show how to compute the exact partition function for lattice statistical-mechanical models whose Boltzmann weights obey a special "crossing" symmetry. The crossing symmetry equates partition functions on different trivalent graphs,…
Many aspects of the asymptotics of Plancherel distributed partitions have been studied in the past fifty years, in particular the limit shape, the distribution of the longest rows, connections with random matrix theory and characters of the…
Fermionic formulas in combinatorial Bethe ansatz consist of sums of products of q-binomial coefficients. There exist refinements without a sum that are known to yield partition functions of box-ball systems with a prescribed soliton…
A bijection is presented between (1): partitions with conditions $f_j+f_{j+1}\leq k-1$ and $ f_1\leq i-1$, where $f_j$ is the frequency of the part $j$ in the partition, and (2): sets of $k-1$ ordered partitions $(n^{(1)}, n^{(2)}, ...,…
For a given sequence $\mathbf{\alpha} = [\alpha_1,\alpha_2,\dots,\alpha_{N+1}]$ of $N+1$ positive integers, we consider the combinatorial function $E(\mathbf{\alpha})(t)$ that counts the nonnegative integer solutions of the equation…
In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and…
We derive, using the algebraic Bethe Ansatz, a generalized Matrix Product Ansatz for the asymmetric exclusion process (ASEP) on a one-dimensional periodic lattice. In this Matrix Product Ansatz, the components of the eigenvectors of the…
Maps are polygonal cellular networks on Riemann surfaces. This paper analyzes the construction of closed form general representations for the enumerative generating functions associated to maps of fixed but arbitrary genus. The method of…
We prove asymptotic upper bounds on the number of $d$-partitions (paving matroids of fixed rank) and partial Steiner systems (sparse paving matroids of fixed rank), using a mixture of entropy counting, sparse encoding, and the probabilistic…
Andrews, Lewis and Lovejoy introduced the partition function PD(n) as the number of partitions of $n$ with designated summands, where we assume that among parts with equal size, exactly one is designated. They proved that PD(3n+2) is…
We show how Andrews' generating functions for generalized Frobenius partitions can be understood within the theory of Eichler and Zagier as specific coefficients of certain Jacobi forms. This reformulation leads to a recursive process which…
We characterize the monomial complete intersections in three variables satisfying the Weak Lefschetz Property (WLP), as a function of the characteristic of the base field. Our result presents a surprising, and still combinatorially obscure,…
We describe various aspects of the Al-Salam-Chihara $q$-Laguerre polynomials. These include combinatorial descriptions of the polynomials, the moments, the orthogonality relation and a combinatorial interpretation of the linearization…
Given a level set $E$ of an arbitrary multiplicative function $f$, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of $\mathbb{1}_E$ into an almost…
This paper is the second in a series of planned papers which provide first bijective proofs of alternating sign matrix results. Based on the main result from the first paper, we construct a bijective proof of the enumeration formula for…