Monthly Archives: January 2018

The Semester Break activities of the High Dimensional Combinatorics and Expanders Special Year

Posted on January 28, 2018 by Gil Kalai

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 →

Posted in Combinatorics, Updates | Tagged | 1 Comment

Akshay Venkatesh Lectures at HUJI – Ostrowski’s Prize Celebration, January 24&25

Posted on January 23, 2018 by Gil Kalai

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 →

Posted in Computer Science and Optimization, Geometry, Number theory, Updates | Tagged , , | Leave a comment

Hardness of Approximating Vertex Cover, Polytope-Integrality-Gap, the Alswede-Kachatrian theorem, and More.

Posted on January 21, 2018 by Gil Kalai

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 →

Posted in Combinatorics, Computer Science and Optimization | Tagged , , , , , , , | 3 Comments

Jacob Fox, David Conlon, and Benny Sudakov: Vast Improvement of our Knowledge on Unavoidable Patterns in Words

Posted on January 11, 2018 by Gil Kalai

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

Posted in Combinatorics | Tagged , , , | Leave a comment

Subhash Khot, Dor Minzer and Muli Safra completed the proof of the 2-to-2 Games Conjecture

Posted on January 10, 2018 by Gil Kalai

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 →

Posted in Combinatorics, Computer Science and Optimization, Updates | Tagged , , | 11 Comments

Interesting Times in Mathematics: Enumeration Without Numbers, Group Theory Without Groups.

Posted on January 9, 2018 by Gil Kalai

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

Posted on January 8, 2018 by Gil Kalai

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 →

Posted in Combinatorics, Computer Science and Optimization, Updates | Tagged , , | 10 Comments

Yael Tauman Kalai’s ICM2018 Paper, My Paper, and Cryptography

Posted on January 6, 2018 by Gil Kalai

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 →

Posted in Combinatorics, Computer Science and Optimization | Tagged , , | 14 Comments