2020 CMS Winter Meeting

Montreal, December 4 - 7, 2020


Doctoral Prize

The Archimedean limit of random sorting networks  [PDF]

Consider a list of n particles labelled in increasing order. A sorting network is a way of sorting this list into decreasing order by swapping adjacent particles, using as few swaps as possible. Simulations of large-n uniform random sorting networks reveal a surprising and beautiful global structure involving sinusoidal particle trajectories, a semicircle law, connections to fluid dynamics, and a theorem of Archimedes.

Based on these simulations, Angel, Holroyd, Romik, and Virag made a series of conjectures about the limiting behaviour of sorting networks. In this talk, I will discuss how to use the local structure and combinatorics of random sorting networks to prove these conjectures.

© Canadian Mathematical Society : http://www.cms.math.ca/