Monthly Archives: December 2024

Last hours of 2024: One Wish, Reviving(?) Polymath3, Peter Sarnak’s Question, and Quantum Plans

Posted on December 31, 2024 by Gil Kalai

A wish It is time for the horrible war to end Polymath thoughts: Reviving Polymath3? A question for our readers: Should we revive polymath3? Polymath3 dealt with the following problem: Is there a polynomial  such that the graph of every … Continue reading →

Posted in Polymath3, Updates | 8 Comments

Winter School on Expansion in Groups, Combinatorics, and Complexity

Posted on December 29, 2024 by Gil Kalai

Next week in Weizmann Institute there will be a Winter school in expansion in groups combinatorics and complexity. (The link includes abstracts for the lectures.) Dates: January 5-8, 2025Venue: The beautiful Lopatie conference center, Weizmann Institute of Science, Israel.Registration: Registration … Continue reading →

Posted in Algebra, Combinatorics, Computer Science and Optimization, Conferences | Tagged | 1 Comment

Qingyang Guan, Joseph Lehec and Bo’az Klartag Solved The Slice Conjecture!

Posted on December 20, 2024 by Gil Kalai

Updates: Here are  slides from a recent lecture of Bo’az at TAU. The conjecture is actually called “the slicing conjecture” or “Bourgain’s slicing conjecture” and not the “slice conjecture”. (There is an unrelated slice-ribbon conjecture in knot theory.) Good news: … Continue reading →

Posted in Analysis, Convexity, Geometry | Tagged , , | 8 Comments

Peter Sarnak is Coming to Town – Let’s Celebrate it with a Post on Möbius Randomness, Computational Complexity, and AI

Posted on December 15, 2024 by Gil Kalai

Peter Sarnak will give the Gordon memorial lectures at the Hebrew University of Jerusalem. At the end of December 2024, Peter Sarnak will deliver the Mark Gordon memorial lecture series on Spectra of locally symmetric geometries at the Hebrew University … Continue reading →

Posted in AI, Computer Science and Optimization, Number theory, Updates | Tagged | 4 Comments

The Case Against Google’s Claims of “Quantum Supremacy”: A Very Short Introduction.

Posted on December 9, 2024 by Gil Kalai

The 2019 paper “Quantum supremacy using a programmable superconducting processor”  asserted that Google’s Sycamore quantum computer,  with 53 qubits and a depth of 20, performed a specific computation in about 200 seconds. According to Google’s estimate, a state-of-the-art classical supercomputer … Continue reading →

Posted in Computer Science and Optimization, Physics, Quantum | Tagged , | 45 Comments