Category Archives: Computer Science and Optimization

Game Theory – on-line Course at IDC, Herzliya

Game theory, a graduate course at IDC, Herzliya; Lecturer: Gil Kalai; TA: Einat Wigderson,  ZOOM mentor: Ethan. Starting Tuesday March 31, I am giving an on-line course (in Hebrew) on Game theory at IDC, Herzliya (IDC English site; IDC Chinese … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Economics, Games, Rationality, Teaching | Tagged , | 1 Comment

Kelman, Kindler, Lifshitz, Minzer, and Safra: Towards the Entropy-Influence Conjecture

Let me briefly report on a remarkable new paper by Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, and Muli Safra, Revisiting Bourgain-Kalai and Fourier Entropies. The paper describes substantial progress towards the Entropy-Influence conjecture, posed by Ehud Friedgut and … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Open problems | Tagged , , , , | Leave a comment

Or Ordentlich, Oded Regev and Barak Weiss: New bounds for Covering Density!

Barak Weiss lectured about his breakthrough results with Or Ordentlich, and Oded Regev, at a Simons Institute workshop: Lattices: Geometry, Algorithms and Hardness. It is a famous problem what is the densest (or, most efficient) packing of unit balls in Euclidean … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Geometry | Tagged , , | 2 Comments

A new PolyTCS blog!

A new PolyTCS blog The PolyTCS Project is a new blog to run collaborative Theoretical Computer Science projects. The initiative is by two graduate students Rupei Xu and Chloe Yang. The logo was designed by Grigory Yaroslavtsev. At this stage … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Mathematics over the Internet | Tagged , , | Leave a comment

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.

A few days ago an historic 160-page paper with a very short title MIP*=RE was uploaded to the arXive by Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen.  I am thankful to Dorit Aharonov and Alon Rosen … Continue reading

Posted in Algebra, Analysis, Combinatorics, Computer Science and Optimization, Physics, Quantum | Tagged , , , , | 13 Comments

Abel in Jerusalem – SUNDAY, January 12, 2020, and other events

Update: Boris Solomyak’s birthday conference (January 13-14, Bar-Ilan University)is now added. I would like to report on seven eight nine ten mathematical events taking place in Jerusalem, the Tel Aviv area, and Haifa in the next few weeks. (Probably I … Continue reading

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

Starting today: Kazhdan Sunday seminar: “Computation, quantumness, symplectic geometry, and information”

Sunday, 27 October, 2019 – 14:00 to 16:00 Repeats every week every Sunday until Sat Feb 01 2020 Location: Ross 70 See also: Seminar announcement; previous post Symplectic Geometry, Quantization, and Quantum Noise. The Google supremacy claims are discussed (with … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Geometry, Physics, Teaching | Tagged , , , | Leave a comment

The story of Poincaré and his friend the baker

Update: After the embargo update (Oct 25): Now that I have some answers from the people involved let me make a quick update: 1) I still find the paper unconvincing, specifically, the few verifiable experiments (namely experiments that can be … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Probability, Quantum, Statistics | Tagged , , | 24 Comments

Gérard Cornuéjols’s baker’s eighteen 5000 dollars conjectures

Gérard Cornuéjols Gérard Cornuéjols‘s beautiful (and freely available) book from 2000 Optimization: Packing and Covering is about an important area of combinatorics which is lovely described in the preface to the book The integer programming models known as set packing … Continue reading

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

Noisy quantum circuits: how do we know that we have robust experimental outcomes at all? (And do we care?)

In a recent post we discussed Google’s claim of achieving “quantum supremacy” and my reasons to think that these claims will not stand. (See also this comment for necessary requirements from a quantum supremacy experiment.) This debate gives a good … Continue reading

Posted in Computer Science and Optimization, Quantum | Tagged , , | 10 Comments