Related papers: An insertion algorithm over staircase tableaux com…
We study the one-dimensional asymmetric simple exclusion process (ASEP) with open boundary conditions. Particles are injected and ejected at both boundaries. It is clarified that the steady state of the model is intimately related to the…
Recently James Martin introduced multiline queues, and used them to give a combinatorial formula for the stationary distribution of the multispecies asymmetric simple exclusion exclusion process (ASEP) on a circle. The ASEP is a model of…
In this work, we introduce new combinatorial objects called Dyck tableaux, which present a natural insertion algorithm. These tools may be useful to describe statistics which are relevant in the study of the physical model named PASEP.
The asymmetric simple exclusion process (ASEP) plays the role of a paradigm in non-equilibrium statistical mechanics. We review exact results for the ASEP obtained by Bethe ansatz and put emphasis on the algebraic properties of this model.…
We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer…
In this paper we obtain general integral formulas for probabilities in the asymmetric simple exclusion process (ASEP) on the integer lattice with nearest neighbor hopping rates p to the right and q=1-p to the left. For the most part we…
We review the staircase algorithm to decompose the exponential of a generalized Pauli matrix and we propose two alternative recursive methods which offer more efficient quantum circuits. The first algorithm we propose, defined as the…
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…
Predicting unobserved entries of a partially observed matrix has found wide applicability in several areas, such as recommender systems, computational biology, and computer vision. Many scalable methods with rigorous theoretical guarantees…
The partially asymmetric exclusion process (PASEP) is an important model from statistical mechanics which describes a system of interacting particles hopping left and right on a one-dimensional lattice of N sites. It is partially asymmetric…
Many algorithms for inserting elements into tableaux are known, starting with the Robinson-Schensted algorithm. Much of those processes can be incorporated into the general framework of Fomin's "growth diagrams". Even for single types of…
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…
We reformulate the Corteel-Williams equations for the stationary state of the two parameter Asymmetric Simple Exclusion Process (TASEP) as a linear map $\mathcal{L}(\,\cdot\,)$, acting on a tensor algebra built from a rank two free module…
We explain how the moments of the (weight function of the) Askey Wilson polynomials are related to the enumeration of the staircase tableaux introduced by the first and fourth authors. This gives us a direct combinatorial formula for these…
The totally asymmetric simple exclusion process (TASEP) is a stochastic model for the unidirectional dynamics of interacting particles on a $1$D-lattice that is much used in systems biology and statistical physics. Its master equation…
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 study a generalization of the asymmetric simple inclusion process (ASIP) on a periodic one-dimensional lattice, where the integers in the particles rates are deformed to their $t$-analogues. We call this the $(q, t, \theta)$~ASIP, where…
The two tableaux assigned by the Robinson--Schensted correspondence are equal if and only if the input permutation is an involution, so the RS algorithm restricts to a bijection between involutions in the symmetric group and standard…
We investigate the totally asymmetric simple exclusion process (TASEP) in the presence of a bottleneck, i.e. a sequence of consecutive defect sites with reduced hopping rate. The influence of such a bottleneck on the phase diagram is…
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…