Answers are grounded in this paper and cite their sources.
Let X(t)=(X₁(t),,Xₙ(t)) be the positions at time t of n particles of the continuous-time totally asymmetric simple exclusion process started from the step configuration Xᵢ(0)=-i, and let pₜ(x)= P(X(t)=x) for x∈ Zⁿ. We prove that \[ p_t(a)\,p_t(b)≤ p_t( {a+b}2 )\,p_t( {a+b}2 ) \] for all n, all t≥0 and all a,b∈ Zⁿ, with rounding taken coordinatewise. In particular pₜ(a)pₜ(b)≤ pₜ(a+b2)² whenever a+b∈2 Zⁿ, which answers a question from the open problem list of the 2025 AIM workshop on KPZ universality. The proof realizes $X(t)$ as a coordinate subvector of the Borodin–Ferrari interlacing array, whose fixed-time law has the explicit weight e⁻ⁿᵗt|λ|∏i<j(lᵢ-lⱼ)/∏ᵢ lᵢ! depending only on the top row. This weight satisfies the rounded-midpoint inequality factor by factor, and the discrete four-functions theorem of Halikias, Klartag and Slomka carries the inequality from the array to any coordinate marginal. The same argument shows that the position of each single particle has a log-concave law.
No takes yet. Share an insight, caveat, or question.
Yitzchak Shmalo (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: