Category Archives: Updates

Matching in NC and Local Events

Matching is in NC Matching theory is one of the richest gold mines of ideas and results in mathematics, computer science, and beyond. Recently, Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj, and Thomas Thierauf proved that bipartite matching is … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Conferences, Updates | 9 Comments

A sensational Ramsey breakthrough by Domagoj Bradač (reblogged from Sam Mattheus’ blog)

Gil’s comment: A great result and a beautiful blog post about it. (I thank Nati Linial and Yuval Wigderson who told me about it.) Here is a blog post about the breakthrough on computational complexity.

Posted in Combinatorics, Updates | Tagged | Leave a comment

Amazing: Erdős’ Unit Distance Problem was Disproved! It was achieved by AI!

Paul Erdős’s, in his 1946  paper published in the American Mathematical Monthly, posed two general questions about the distribution of distances determined by a finite set of points in a metric space. 1. Unit Distance Problem: At most how many … Continue reading

Posted in AI, Combinatorics, Geometry, Updates, What is Mathematics | Tagged , , | 32 Comments

Updates and Plans V: From Boise to Tel Aviv, Ceasefire, My 70th Birthday, Nostalgia, Problems, Outrageous Conjectures, Quantum, and AI

This is the fifth post of this type (I (2008); II(2011); III(2015); IV(2024)). Between Boise and Tel Aviv During the summer we spent two months in the lovely city of Boise, Idaho. We stayed with my son Hagai and his husband Felix, … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Open problems, personal, Updates | Tagged | 9 Comments

ICECA 2026 (August 17-19, 2026), an interview with Christian Krattenthaler, and Condorcet revisited.

Toufic Mansour, Christian Krattenthaler, and Condorcet. International Conference on Enumerative Combinatorics and Applications (ICECA 2026) The fifth International Conference on Enumerative Combinatorics and Applications will take place online on August 17-19, 2026.  Invited speakers include George E. Andrews, Sara Billey, … Continue reading

Posted in Combinatorics, Conferences, Updates | Tagged , , , | 3 Comments

Combinatorial Morning in Tel Aviv, Sunday 28/12/2025

Coming very soon! Organizer:      Michael Krivelevich Place:  Schreiber 309, Tel Aviv University Event’s site.  https://sites.google.com/view/combinatorics-seminar-tel-aviv Program 09:30-10:00        Asaf Ferber (UC Irvine)  Quantum algorithms on graphs 10:00-10:30        Gal Kronenberg (Oxford U.)  2-factors in … Continue reading

Posted in Combinatorics, Updates | Leave a comment

November’s Lectures, 2025

Happy Chanukah, everybody! There is a lot of academic activity around, and the ceasefire in Gaza has brought some relief and hope. Let me tell you about the (unusually high number of) lectures I attended in November 2025, in reverse … Continue reading

Posted in AI, Combinatorics, Computer Science and Optimization, Geometry, Physics, Quantum, Updates | 12 Comments

Kazhdan Seminar fall 2025 – Starting Today Oct. 19, 2026.

This semester as a part of Kazhdan Sunday seminars we will have the following two activities (see description below) 12-14 Nati Linial and Yuval Peled,  “Recent advances in combinatorics” 14-16 Jake Solomon “Curve counts and quadratic forms”.  Both seminars will take … Continue reading

Posted in Combinatorics, Geometry, Updates | Tagged , , , | 1 Comment

International Conference on Enumerative Combinatorics and Applications ICECA 2025 (August 25-27, 2025)

Toufic Mansour The fourth International Conference on Enumerative Combinatorics and Applications will take place online, August 25–27, 2025. As in the previous three editions, the conference opens with a lecture by Richard Stanley—this time on “Symmetric functions arising from a … Continue reading

Posted in Combinatorics, Conferences, Updates | Tagged | 2 Comments

Amazing: Jie Ma, Wujie Shen, and Shengjie Xie Gave an Exponential Improvement for Ramsey Lower Bounds

h/t Benny Sudakov The Ramsey number R(ℓ,k) is the smallest integer n such that in any two-coloring of the edges of the complete graph on n vertices, , by red and blue, there is either a red (a complete graph … Continue reading

Posted in Combinatorics, Geometry, Probability, Updates | Tagged , , | 8 Comments