Recent Comments

Recent Posts
 Hoi Nguyen and Melanie Wood: Remarkable Formulas for the Probability that Projections of Lattices are Surjective
 Petra! Jordan!
 The largest clique in the Paley Graph: unexpected significant progress and surprising connections.
 Thinking about the people of Wuhan and China
 Ringel Conjecture, Solved! Congratulations to Richard Montgomery, Alexey Pokrovskiy, and Benny Sudakov
 Test your intuition 43: Distribution According to Areas in Top Departments.
 Two talks at HUJI: on the “infamous lower tail” and TOMORROW on recent advances in combinatorics
 Amazing: Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen proved that MIP* = RE and thus disproved Connes 1976 Embedding Conjecture, and provided a negative answer to Tsirelson’s problem.
 Do Not Miss: Abel in Jerusalem, Sunday, January 12, 2020
Top Posts & Pages
 Hoi Nguyen and Melanie Wood: Remarkable Formulas for the Probability that Projections of Lattices are Surjective
 Aubrey de Grey: The chromatic number of the plane is at least 5
 Konstantin Tikhomirov: The Probability that a Bernoulli Matrix is Singular
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 Ringel Conjecture, Solved! Congratulations to Richard Montgomery, Alexey Pokrovskiy, and Benny Sudakov
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Gil's Collegial Quantum Supremacy Skepticism FAQ
 Coloring Problems for Arrangements of Circles (and Pseudocircles)
 Amazing! Keith Frankston, Jeff Kahn, Bhargav Narayanan, Jinyoung Park: Thresholds versus fractional expectationthresholds
RSS
Monthly Archives: January 2018
The Semester Break activities of the High Dimensional Combinatorics and Expanders Special Year
UPDATE: Schedule change! An additional workshop On February 5 and shift in dats of the others. Here is the calendar We have now at HUJI a semester break, but the special semester in High dimensional combinatorics and IIAS leaded by … Continue reading
Akshay Venkatesh Lectures at HUJI – Ostrowski’s Prize Celebration, January 24&25
Thursday January 25, 14:1515:45 Ostrowski’s prize ceremony and Akshay Venkatesh’s prize lecture: Period maps and Diophantine problems Followed by a Basic notion lecture by Frank Calegary 16:3017:45: The cohomology of arithmetic groups and Langlands program Wednesday January 24, 18:0017:00: Akshay Venkatesh … Continue reading
Hardness of Approximating Vertex Cover, PolytopeIntegralityGap, the AlswedeKachatrian theorem, and More.
Lior Silberman asked about applications of the 2to2 game theorem to hardness of approximation, and James Lee answered mentioning applications to vertex cover. Let me elaborate a little on vertex cover, and other matters. (Here is the pervious post on … Continue reading
Jacob Fox, David Conlon, and Benny Sudakov: Vast Improvement of our Knowledge on Unavoidable Patterns in Words
I heard a lecture by Benny Sudakov on the remarkable paper Towertype bounds for unavoidable patterns in words, by David Conlon, Jacob Fox, and Benny Sudakov. Here are the slides, and let me let the slides speak for themselves. The problem
Subhash Khot, Dor Minzer and Muli Safra completed the proof of the 2to2 Games Conjecture
Update: A related blog post by Boaz Barak: Unique Games Conjecture – halfway there? The 2to2 Games Conjecture is a somewhat weaker form of Khot’s unique game conjecture. The paper is: Pseudorandom Sets in Grassmann Graph have NearPerfect Expansion by Subhash Khot, Dor … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Updates
Tagged Dor Minzer, Muli Safra, Subhash Khot
10 Comments
Interesting Times in Mathematics: Enumeration Without Numbers, Group Theory Without Groups.
Lie Theory without Groups: Enumerative Geometry and Quantization of Symplectic Resolutions Our 21th Midrasha (school) IIAS, January 7 – January 12, 2018 Jerusalem Enumerative Geometry Beyond Numbers MSRI, January 16, 2018 to May 25, 2018 Abstract for the Midrasha
Posted in Algebra, Combinatorics, Geometry, Updates
Leave a comment
Cody Murray and Ryan Williams’ new ACC breakthrough: Updates from Oded Goldreich’s Choices
Thanks to Irit Dinur for telling me about the following: Oded Goldreich’s recent choice is about the paper: Circuit Lower Bounds for Nondeterministic QuasiPolytime: An Easy Witness Lemma for NP and NQP, by Corry Murray and Ryan Williams. Ryan Williams … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Updates
Tagged Circuit complexity, Cody Murray, Ryan Williams
9 Comments
Yael Tauman Kalai’s ICM2018 Paper, My Paper, and Cryptography
Yael Tauman Kalai: Delegating Computation via NoSignaling Strategies. Ladies and Gentelmen, Here is, exclusively for our readers, Yael Tauman Kalai’s ICM2018 paper: Delegating Computation via NoSignaling Strategies. The opportunity to present the paper arose when a week ago I attended … Continue reading
Posted in Combinatorics, Computer Science and Optimization
Tagged cryptography, ICM2018, Yael Kalai
7 Comments