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

Consider equipped with a norm. Given a finite set of points and a point , we consider , the sum of distances from to the points in . Next we consider the set of points that attain the minimum of … Continue reading →

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 →

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 →

Good news: the slice conjecture is now completely settled with combined effort of two separate papers. Qingyang Guan,  A note on Bourgain’s slicing problem Abstract: This note is to study Bourgain’s slicing problem following the routes investigated in the last … Continue reading →

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 →