REVIEW 3 cited by
From multiline queues to Macdonald polynomials via the exclusion process
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
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 particles hopping on a one-dimensional lattice, which was introduced around 1970, and has been extensively studied in statistical mechanics, probability, and combinatorics. In this article we give an independent proof of Martin's result, and we show that by introducing additional statistics on multiline queues, we can use them to give a new combinatorial formula for both the symmetric Macdonald polynomials P_{lambda}(x; q, t), and the nonsymmetric Macdonald polynomials E_{lambda}(x; q, t), where lambda is a partition. This formula is rather different from others that have appeared in the literature, such as the formulas due to Haglund, Haiman, and Loehr, the formula due to Ram and Yip, and the one due to Lenart. Our proof uses results of Cantini, de Gier, and Wheeler, who recently linked the multispecies ASEP on a circle to Macdonald polynomials.
Forward citations
Cited by 3 Pith papers
-
Formulas for Koornwinder polynomials
New uncompressed and compressed set-valued tableaux formulas give explicit monomial expansions for all relative Koornwinder polynomials.
-
An explicit power series result for the two type ASEP
The paper states a power series formula for the generating function of the two-type ASEP with configuration (2,1,0,...,0), but the proof of the main decomposition is missing.
-
Combinatorial mappings of exclusion processes
A topical review of ASEP steady-state combinatorics that derives a new determinant form of the TASEP partition function and proposes an unproven bijection between decorated Motzkin paths and permutations.
Discussion (0). Continue with ORCID to comment.