ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let RSNn\mathbf{RSN}^n be a uniformly random sorting network of Sn\mathcal{S}_n, regarded as a permutation process, and let A=(A(t);0≤t≤1)\mathcal{A}=(\mathcal{A}(t);0\leq t\leq1) be the Archimedean process defined by A(t)=cos⁡(πt)Ax+sin⁡(πt)Ay\mathcal{A}(t)=\cos(\pi t)\mathbf{A}_x+\sin(\pi t)\mathbf{A}_y, with (Ax,Ay)(\mathbf{A}_x,\mathbf{A}_y) distributed according to the Archimedean measure.

Archimedean process convergence conjecture. RSNn\mathbf{RSN}^n converges in probability, as a permutation process, to the Archimedean process.

This conjecture combines the expected Archimedean path and sine-curve behavior into a process-level convergence statement. The source presents it as a reasonable conjecture and does not report a resolution.

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.