Recent Comments
-
Recent Posts
- What is mathematics (or at least, how it feels)
- Alef’s Corner
- To cheer you up in difficult times 22: some mathematical news! (Part 1)
- Cheerful News in Difficult Times: The Abel Prize is Awarded to László Lovász and Avi Wigderson
- Amazing: Feng Pan and Pan Zhang Announced a Way to “Spoof” (Classically Simulate) the Google’s Quantum Supremacy Circuit!
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky’s conjectures
- Nostalgia corner: John Riordan’s referee report of my first paper
- At the Movies III: Picture a Scientist
- At the Movies II: Kobi Mizrahi’s short movie White Eye makes it to the Oscar’s short list.
Top Posts & Pages
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky's conjectures
- To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
- What is mathematics (or at least, how it feels)
- The Argument Against Quantum Computers - A Very Short Introduction
- Extremal Combinatorics VI: The Frankl-Wilson Theorem
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Cheerful News in Difficult Times: The Abel Prize is Awarded to László Lovász and Avi Wigderson
- Yael Tauman Kalai's ICM2018 Paper, My Paper, and Cryptography
- 8866128975287528³+(-8778405442862239)³+(-2736111468807040)³
RSS
Tag Archives: Random sorting networks
Duncan Dauvergne and Bálint Virág Settled the Random Sorting Networks Conjectures
A short summary: The beautiful decade-old conjectures on random sorting networks by Omer Angel, Alexander Holroyd, Dan Romik, and Bálint Virág, have now been settled by Duncan Dauvergne and Bálint Virág in two papers: Circular support in random sorting networks, by Dauvergne … Continue reading
Posted in Combinatorics, Probability, Updates
Tagged Bálint Virág, Dubcan Dauvergne, Random sorting networks
2 Comments