Schubert polynomials, the inhomogeneous TASEP, and evil-avoiding permutations

preprint2022arXivOpen access

Abstract

Consider a lattice of n sites arranged around a ring, with the nn sites occupied by particles of weights {1,2,…,n}\{1,2,\dots,n\}; the possible arrangements of particles in sites thus corresponds to the n!n! permutations in SnS_n. The inhomogeneous totally asymmetric simple exclusion process (or TASEP) is a Markov chain on the set of permutations, in which two adjacent particles of weights i<ji<j swap places at rate xi−yn+1−jx_i - y_{n+1-j} if the particle of weight jj is to the right of the particle of weight ii. (Otherwise nothing happens.) In the case that yi=0y_i=0 for all ii, the stationary distribution was conjecturally linked to Schubert polynomials by Lam-Williams, and explicit formulas for steady state probabilities were subsequently given in terms of multiline queues by Ayyer-Linusson and Arita-Mallick. In the case of general yiy_i, Cantini showed that nn of the n!n! states have probabilities proportional to products of double Schubert polynomials. In this paper we introduce the class of evil-avoiding permutations, which are the permutations avoiding the patterns 2413,4132,42132413, 4132, 4213 and 32143214. We show that there are (2+2)n−1+(2−2)n−12\frac{(2+\sqrt{2})^{n-1}+(2-\sqrt{2})^{n-1}}{2} evil-avoiding permutations in SnS_n, and for each evil-avoiding permutation ww, we give an explicit formula for the steady state probability ψwψ_w as a product of double Schubert polynomials. We also show that the Schubert polynomials that arise in these formulas are flagged Schur functions, and give a bijection in this case between multiline queues and semistandard Young tableaux.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.