Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1510.05023

Combinatorics of the two-species ASEP and Koornwinder moments

Sylvie Corteel·Olya Mandelshtam·Lauren Williams
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 Askey-Wilson weight function. The fact that the ASEP and Askey-Wilson moments are related at all is quite surprising, and is due to Uchiyama-Sasamoto-Wadati. The ASEP is a model of particles hopping on a one-dimensional lattice of N sites with open boundaries, particles can enter and exit at both left and right borders. It was introduced around 1970 and is cited as a model for both traffic flow and translation in protein synthesis. Meanwhile, the Askey-Wilson polynomials are a family of orthogonal polynomials in one variable, they sit at the top of the hierarchy of classical orthogonal polynomials. So we have the relationship ASEP -- staircase tableaux -- Askey-Wilson moments It is well-known that Askey-Wilson polynomials can be viewed as the one-variable case of the multivariate Koornwinder polynomials, also known as the Macdonald polynomials for the type BC root system. It is natural then to ask whether one can generalize the relationships among the ASEP, Askey-Wilson moments, and staircase tableaux, in such a way that Koornwinder moments replace Askey-Wilson moments. In a recent work, we demonstrated a close connection between Koornwinder moments and the two-species ASEP (a particle model involving two species of particles with different "weights"). In this article we introduce rhombic staircase tableaux, and show that we have the relationship 2-species ASEP -- rhombic staircase tableaux -- Koornwinder moments In particular, we give formulas for the steady state distribution of the two-species ASEP and for Koornwinder moments, in terms of rhombic staircase tableaux.

Explore related subjects

math.COmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sylvie Corteel, Olya Mandelshtam, Lauren Williams. 2020-01-14. Combinatorics of the two-species ASEP and Koornwinder moments. https://doi.org/10.1016/j.aim.2017.09.034

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO↗
arXiv2026

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO↗
arXiv2026

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO↗