Recent Comments
Advertisements
Author Archives: Gil Kalai
Itai Benjamini and Jeremie Brieussel: Noise Sensitivity Meets Group Theory
The final version of my ICM 2018 paper Three puzzles on mathematics computation and games is available for some time. (This proceeding’s version unlike the arXived version has a full list of references.) In this post I would like to … Continue reading
Posted in Algebra, Combinatorics, Probability
Tagged Itai Benjamini, Jeremie Brieussel, Noise-sensitivity
Leave a comment
Amazing: Hao Huang Proved the Sensitivity Conjecture!
Today’s arXived amazing paper by Hao Huang’s Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture Contains an amazingly short and beautiful proof of a famous open problem from the theory of computing – the sensitivity conjecture posed … Continue reading
Posted in Combinatorics, Computer Science and Optimization
Tagged Hao Huang, sensitivity conjecture
5 Comments
Another sensation – Annika Heckel: Non-concentration of the chromatic number of a random graph
Annika Heckel Sorry for the long period of non blogging. There are a lot of things to report and various other plans for posts and I hope to come back to it soon. But it is nice to break the … Continue reading
A sensation in the morning news – Yaroslav Shitov: Counterexamples to Hedetniemi’s conjecture.
Two days ago Nati Linial sent me an email entitled “A sensation in the morning news”. The link was to a new arXived paper by Yaroslav Shitov: Counterexamples to Hedetniemi’s conjecture. Hedetniemi’s 1966 conjecture asserts that if and are two … Continue reading
Posted in Combinatorics, Open problems, Updates
Tagged Hedetniemi's conjecture, Yaroslav Shitov
14 Comments
Answer to TYI 37: Arithmetic Progressions in 3D Brownian Motion
Consider a Brownian motion in three dimensional space. We asked (TYI 37) What is the largest number of points on the path described by the motion which form an arithmetic progression? (Namely, , so that all are equal.) Here is … Continue reading
Posted in Combinatorics, Open discussion, Probability
Tagged Brownian motion, Gady Kozma, Itai Benjamini
1 Comment
The last paper of Catherine Rényi and Alfréd Rényi: Counting k-Trees
A k-tree is a graph obtained as follows: A clique with k vertices is a k-tree. A k-tree with n+1 vertices is obtained from a k-tree with n-vertices by adding a new vertex and connecting it to all vertices of a … Continue reading
Are Natural Mathematical Problems Bad Problems?
One unique aspect of the conference “Visions in Mathematics Towards 2000” (see the previous post) was that there were several discussion sessions where speakers and other participants presented some thoughts about mathematics (or some specific areas), discussed and argued. In … Continue reading
Posted in Combinatorics, Conferences, Open discussion, What is Mathematics
Tagged Misha Gromov
1 Comment
An Invitation to a Conference: Visions in Mathematics towards 2000
Let me invite you to a conference. The conference took place in 1999 but only recently the 57 videos of the lectures and the discussion sessions are publicly available. (I thank Vitali Milman for telling me about it.) One novel … Continue reading
The (Random) Matrix and more
Three pictures, and a few related links. Van Vu Spoiler: In one of the most intense scenes, the protagonist, with his bare hands and against all odds, took care of the mighty Wigner semi-circle law in two different ways. (From … Continue reading
Posted in Combinatorics, People, What is Mathematics
Tagged Alfréd Rényi, András Hajnal, Catherine Rényi, Paul Erdos, Saharon Shelah, Sándor Szalai, Van Vu
1 Comment
