Tag Archives: Random sorting networks

Duncan Dauvergne and Bálint Virág Settled the Random Sorting Networks Conjectures

Posted on May 20, 2018 by Gil Kalai

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

	ICM2018 First Report… on A Few Mathematical Snapshots f…
	ICM2018 First Report… on Mabruk Elon, India, and M…
	Summer conferences i… on Building Bridges II, and Rio I…
	Gil Kalai on Aaronson and Arkhipov’s…
	Gil Kalai on Aaronson and Arkhipov’s…
	Gil Kalai on Octonions to the Rescue
	Austin on Test Your Intuition 35: What i…
	Christian Blatter on Test Your Intuition 35: What i…
	Building Bridges II,… on The Thompson Group
	Shen-Fu Tsai on Test Your Intuition 35: What i…
	rt34 on Test Your Intuition 35: What i…
	Johnson on Test Your Intuition (34): Tili…

Tag Archives: Random sorting networks

Duncan Dauvergne and Bálint Virág Settled the Random Sorting Networks Conjectures

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives