Multiline-queue Markov-chain conjecture for inhomogeneous multispecies TASEP weights
Multiline-queue Markov-chain conjecture for inhomogeneous multispecies TASEP weights
Let be a multiline queue with state space , and let be the state space of the corresponding inhomogeneous multispecies exclusion process. For , let be the number of vacancies on row that are -covered by bully paths. Let be the number of vacancies on row , and define
Let denote the bully-path projection from multiline queues to particle configurations. Multiline-queue Markov-chain conjecture. There is a Markov chain on which lumps via to the inhomogeneous multispecies exclusion process on , such that the stationary weight of every configuration is
This conjecture would give a combinatorial realization of the Lam–Williams stationary weights and extend them to multipermutations. The paper reports partial results supporting it, but says that it has not been settled in full generality.
Sources & referencesView supporting material
Primary source
Arvind Ayyer and Svante Linusson, “An Inhomogeneous Multispecies TASEP on a Ring”, arXiv:1206.0316 (2014).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.