相关论文: Tableaux combinatorics of the two-species PASEP
We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…
A traffic model on an open one-dimensional lattice is considered. At any discrete time moment, with prescribed probability, a particle arrives to the leftmost cell of the lattice, and, with prescribed probability, the arriving particle…
The combinatorics of certain osculating lattice paths is studied, and a relationship with oscillating tableaux is obtained. More specifically, the paths being considered have fixed start and end points on respectively the lower and right…
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…
We study the combinatorics of the change of basis of three representations of the stationary state algebra of the two parameter simple asymmetric exclusion process. Each of the representations considered correspond to a different set of…
We investigate a modified version of the $AB$ random sequential adsorption model. Specifically, this model involves the deposition of two distinct types of particles onto a lattice, with the constraint that different types cannot occupy…
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…
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.…
In this paper, we study tree--like tableaux and some of their probabilistic properties. Tree--like tableaux are in bijection with other combinatorial structures, including permutation tableaux, and have a connection to the partially…
In the asymmetric simple exclusion process on the integers each particle waits exponential time, then with probability p it moves one step to the right if the site is unoccupied, otherwise it stays put; and with probability q=1-p it moves…
A mixture of spin-polarized light and heavy fermionic atoms on a finite size 2D optical lattice is considered at various temperatures and values of the coupling between the two atomic species. In the case, where the heavy atoms are immobile…
A mixture of light and heavy spin-polarized fermionic atoms in an optical lattice is considered. Tunneling of the heavy atoms is neglected such that they are only subject to thermal fluctuations. This results in a complex interplay between…
By generalizing the algebra of operators of the Asymmetric Simple Exclusion Process (ASEP), a multi-species ASEP in which particles can overtake each other,is defined on both open and closed one dimensional chains. On the ring the steady…
The multispecies asymmetric simple exclusion process (mASEP) is a Markov chain in which particles of different species hop along a one-dimensional lattice. This paper studies the doubly asymmetric simple exclusion process…
A discrete-time totally asymmetric simple exclusion process on a lattice with open boundaries is considered. There are particles of different types. The type of a particle is characterized by the probability that a particle moves to a…
We introduce and study several random combinatorial billiard trajectories. Such a system, which depends on a fixed parameter $p\in(0,1)$, models a beam of light that travels in a Euclidean space, occasionally randomly reflecting off of a…
Regarding the Specht modules associated to the two-row partition $(n,n)$, we provide a combinatorial path model to study the transitioning matrix from the tableau basis to the $A_1$-web basis (i.e. cup diagrams), and prove that the entries…
The TASEP is a paradigmatic model from non-equilibrium statistical physics, which describes particles hopping along a lattice of discrete sites. The TASEP is applicable to a broad range of different transport systems, but does not consider…
We revisit the problem of hard particles on planar random tetravalent graphs in view of recent combinatorial techniques relating planar diagrams to decorated trees. We show how to recover the two-matrix model solution to this problem in…
Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…