Recent Comments
mathematicalsilence on The Ramanujan Challenge for… Gil Kalai on Polymath Plus AI Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Gil Kalai on Matching in NC and Local … rohitgurjar0 on Matching in NC and Local … Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Matching in NC and L… on Open problem session of HUJI-C… -
Recent Posts
- The Ramanujan Challenge for AI
- Matching in NC and Local Events
- A sensational Ramsey breakthrough by Domagoj Bradač (reblogged from Sam Mattheus’ blog)
- Three Interviews
- Amazing: Erdős’ Unit Distance Problem was Disproved! It was achieved by AI!
- Polymath Plus AI
- Starting Today: Kazhdan Sunday seminar: “Boolean Functions, Hypercontractivity, and Applications”
- Scott Aaronson’s View of my View About Quantum Computing
- The Fully Depolarizing Noise Conjecture for Physical Cat States is Twenty Years Old!
Top Posts & Pages
- The Ramanujan Challenge for AI
- יופיה של המתמטיקה
- The Polynomial Hirsch Conjecture: Discussion Thread
- Polymath 3: Polynomial Hirsch Conjecture
- A Few Slides and a Few Comments From My MIT Lecture on Quantum Computers
- Polymath10: The Erdos Rado Delta System Conjecture
- Polymath 3: The Polynomial Hirsch Conjecture 2
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- Why Quantum Computers Cannot Work: The Movie!
RSS
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
3 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
9 Comments