The conjectural formula for the one-wrapping count gamma

Let b3(s,n)b3^\ell(s,n) denote the number of continuous multiline queues with the specified one-wrapping configuration, and let f(n1,s+1)f_{(n-1,s+1)} denote the relevant hook-length count. The conjectural formula.

γ(s,n)=(1)(n+2ss)f(n1,s+1).\gamma^\ell(s,n)= (\ell-1)\binom{n+2s-\ell}{s-\ell}f_{(n-1,s+1)}.

This formula is proposed after numerical checks because no closed form for the preceding sum was found; the source gives no proof or resolution.

Sources & referencesView supporting material

Primary source

Nimisha Pahuja and Surjadipta de Sarkar, “Correlations in the continuous multispecies TASEP on a ring”, arXiv:2212.05689 (2025).

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.