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

	Congrats Avi and Lac… on Cheerful News in Difficult Tim…
	Yiftach on Alef’s Corner
	Gil Kalai on Alef’s Corner
	Yiftach on Alef’s Corner
	PratibhaGupta on Cheerful News in Difficult Tim…
	To cheer you up in d… on The Intermediate Value Theorem…
	Closing an Erdős Pro… on To cheer you up in difficult t…
	2021 Abel Prize \| Ig… on Cheerful News in Difficult Tim…
	Cheerful News in Dif… on To Cheer You Up in Difficult T…
	Cheerful News in Dif… on To cheer you up in difficult t…
	Cheerful News in Dif… on Avi Wigderson’s: “…
	Cheerful News in Dif… on Must-read book by Avi Wig…

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