Recent Comments
-
Recent Posts
- Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s
- Igor Pak: How I chose Enumerative Combinatorics
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Noga Alon and Udi Hrushovski won the 2022 Shaw Prize
- Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem
- Past and Future Events
- Joshua Hinman proved Bárány’s conjecture on face numbers of polytopes, and Lei Xue proved a lower bound conjecture by Grünbaum.
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- Combinatorial Convexity: A Wonderful New Book by Imre Bárány
Top Posts & Pages
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Igor Pak: How I chose Enumerative Combinatorics
- Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem
- Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s
- Richard Stanley: How the Proof of the Upper Bound Theorem (for spheres) was Found
- The Argument Against Quantum Computers - A Very Short Introduction
- A sensation in the morning news - Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- To cheer you up in difficult times 13: Triangulating real projective spaces with subexponentially many vertices
RSS
Monthly Archives: February 2018
Serge Vlăduţ : Lattices with exponentially large kissing numbers
(I thank Avi Wigderson for telling me about it.) Serge Vlăduţ just arxived a paper with examples of lattices in such that the kissing number is exponential in . The existence of such a lattice is a very old open … Continue reading
Peter Keevash and Eoin Long: Forbidden vector-valued intersections
Peter Keevash and Eoin Long arxived some time ago a very nice paper: Forbidden vector-valued intersections, which settled a problem that was first posed here on the blog. Here is the abstract. We solve a generalised form of a conjecture of Kalai … Continue reading
Peter Keevash: More and Easier Designs!
Peter Keevash just posted on the arxiv a couple of new papers on designs. The first is a rewritten version of his original paper The existence of designs with a much simpler proof. The second paper The existence of designs … Continue reading
Monday February 19: Quantum Coding and High Dimensional Expanders
Tonight at 8:00 Israel time TCS+ Dor Misner on 2-to-2 games. On Monday, February 19, we will have a special day on “Quantum Coding and High Dimensional Expanders” organized by Gilles Zemor. Sandwiches will be served for lunch, alongside … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Conferences, Quantum, Updates
Tagged Dorit Aharonov, Gilles Zemor
2 Comments
My Argument Against Quantum Computers: An Interview with Katia Moskvitch on Quanta Magazine
Quanta Magazine published an interview with me about quantum computers. It was a pleasure discussing this issue with Katia Moskvitch and I enjoyed also the photo session with David Vaaknin who also took a video of me explaining the importance of … Continue reading