The continuous one-away TASEP density conjecture

From papers

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 w0w_0 be the longest permutation. For n>k1n>k\ge 1 and 0q1<<qn<10\le q_1<\dots<q_n<1, the continuous one-away density conjecture.

gskw0=(1k!kqnk+1qn1)gw0.g_{s_kw_0}=\left(\frac{1}{k!}\frac{\partial^k}{\partial q_{n-k+1}\dots\partial q_n}-1\right)g_{w_0}.

This is the continuous-distribution counterpart of the one-away multiline-queue enumeration conjecture, obtained by passing to the scaling limit. The source presents it as a conjectural consequence rather than a proved general formula.

Progress summary

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

Sources & referencesView supporting material

Primary source

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

Solutions 0

No solutions have been posted yet.