- Mathematical news to cheer you up
- To Cheer You Up in Difficult Times 28: Math On the Beach (Alef’s Corner)
- To cheer you up in difficult times 27: A major recent “Lean” proof verification
- To cheer you up in difficult times 26: Two real-life lectures yesterday at the Technion
- To Cheer You Up in Difficult times 24: Borodin’s colouring conjecture!
- To cheer you up in difficult times 25: some mathematical news! (Part 2)
- To cheer you up in difficult times 23: the original hand-written slides of Terry Tao’s 2015 Einstein Lecture in Jerusalem
- Alef Corner: ICM2022
- The probabilistic proof that 2^400-593 is a prime: a revolutionary new type of mathematical proof, or not a proof at all?
Top Posts & Pages
- Mathematical news to cheer you up
- The Argument Against Quantum Computers - A Very Short Introduction
- A sensation in the morning news - Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
- To cheer you up in difficult times 27: A major recent "Lean" proof verification
- Zur Luria on the n-Queens Problem
- To Cheer You Up in Difficult Times 28: Math On the Beach (Alef's Corner)
- The Quantum Fault-Tolerance Debate Updates
- Around Borsuk’s Conjecture 3: How to Save Borsuk's conjecture
- To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
Monthly Archives: January 2018
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
Thursday January 25, 14:15-15: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:30-17:45: The cohomology of arithmetic groups and Langlands program Wednesday January 24, 18:00-17:00: Akshay Venkatesh … Continue reading
Hardness of Approximating Vertex Cover, Polytope-Integrality-Gap, the Alswede-Kachatrian theorem, and More.
Lior Silberman asked about applications of the 2-to-2 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 Tower-type 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
Update: A related blog post by Boaz Barak: Unique Games Conjecture – halfway there? The 2-to-2 Games Conjecture is a somewhat weaker form of Khot’s unique game conjecture. The paper is: Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion by Subhash Khot, Dor … Continue reading
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
Thanks to Irit Dinur for telling me about the following: Oded Goldreich’s recent choice is about the paper: Circuit Lower Bounds for Nondeterministic Quasi-Polytime: An Easy Witness Lemma for NP and NQP, by Corry Murray and Ryan Williams. Ryan Williams … Continue reading
Yael Tauman Kalai: Delegating Computation via No-Signaling Strategies. Ladies and Gentelmen, Here is, exclusively for our readers, Yael Tauman Kalai’s ICM2018 paper: Delegating Computation via No-Signaling Strategies. The opportunity to present the paper arose when a week ago I attended … Continue reading