ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ωn\omega_n be an nn-element uniform sorting network, let Sn{\mathbb S}_n denote the permutahedron, and let d∞d_\infty be the distance from a sorting network to a great circle defined by

d∞(ω,c):=max⁡i∈[1,N]inf⁡z∈c∥σi−1−z∥∞.d_\infty(\omega,c):=\max_{i\in[1,N]}\inf_{z\in c}\|\sigma_i^{-1}-z\|_\infty.

A sequence is o(n)o(n) in probability if its ratio to nn converges to zero in probability. Great circles. For each nn there exists a random great circle Cn⊂SnC_n\subset{\mathbb S}_n such that

d∞(ωn,Cn)=o(n)in probability asn→∞.d_\infty(\omega_n,C_n)=o(n)\quad\text{in probability as}\quad n\to\infty.

If true, this would explain the conjectured sine trajectories, Archimedes limiting configurations, and semicircle-law swap process through the deterministic great-circle theorem stated nearby. The supplied text does not resolve whether uniform sorting networks lie close to random great circles.

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.