Great-circle conjecture for uniform sorting networks
Statement
Let be an -element uniform sorting network, let denote the permutahedron, and let be the distance from a sorting network to a great circle defined by
A sequence is in probability if its ratio to converges to zero in probability. Great circles. For each there exists a random great circle such that
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.