The continuous multi-away TASEP density conjecture

Let gw(q1,,qn)g_w(q_1,\dots,q_n) denote the stationary probability density for the continuous TASEP configuration with permutation ww, and let k=(k1kr1)\mathbf{k}=(k_1\ge\cdots\ge k_r\ge 1) satisfy

n>k1>k2+1>k3+2>>kr+r1>r1.n>k_1>k_2+1>k_3+2>\dots>k_r+r-1>r-1.

For 0q1<<qn<10\le q_1<\dots<q_n<1, the continuous multi-away density conjecture.

gsk1skrw0=(1kr!krqnkr+1qn1)gsk1skr1w0.g_{s_{k_1}\dots s_{k_r}w_0}=\left(\frac{1}{k_r!}\frac{\partial^{k_r}}{\partial q_{n-k_r+1}\dots\partial q_n}-1\right)g_{s_{k_1}\dots s_{k_{r-1}}w_0}.

This conjecture translates the multi-away multiline-queue enumeration formula into a recursive relation for continuous stationary densities. The paper reports no proof of this general relation.

Sources & referencesView supporting material

Primary source

Erik Aas and Svante Linusson, “Continuous Multi-line Queues and TASEP”, arXiv:1501.04417 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.