ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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>k≥1n>k\ge 1 and 0≤q1<⋯<qn<10\le q_1<\dots<q_n<1, the continuous one-away density conjecture.

gskw0=(1k!∂k∂qn−k+1…∂qn−1)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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.