Recent Comments
Giving a talk at Eli… on Academic Degrees and Sex Johan Aspegren on To Cheer You Up in Difficult T… To cheer you up in d… on Another sensation – Anni… Gil Kalai on To Cheer You Up in Difficult T… Gil Kalai on To Cheer You Up in Difficult T… Alexander Barvinok on To Cheer You Up in Difficult T… Kevin on To Cheer You Up in Difficult T… Gil Kalai on To Cheer You Up in Difficult T… Arseniy on To Cheer You Up in Difficult T… Alexander Barvinok on To Cheer You Up in Difficult T… uniform on To Cheer You Up in Difficult T… Arseniy on To Cheer You Up in Difficult T…
Monthly Archives: May 2018
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
Zur Luria on the n-Queens Problem
(From Wikipedia ) The eight queens puzzle is the famous problem of placing eight chess queens on a chessboard so that no two queens threaten each other. The questions if this can be done and in how many different ways, as well as the extension … Continue reading
Posted in Combinatorics, Games
Tagged Chess, Eight-queens puzzle, n-queens problem, Zur Luria
8 Comments
