Recent Comments
-
Recent Posts
- The Trifference Problem
- Greatest Hits 2015-2022, Part II
- Greatest Hits 2015-2022, Part I
- Tel Aviv University Theory Fest is Starting Tomorrow
- Alef’s Corner
- A Nice Example Related to the Frankl Conjecture
- Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
- Barnabás Janzer: Rotation inside convex Kakeya sets
- Inaugural address at the Hungarian Academy of Science: The Quantum Computer – A Miracle or Mirage
Top Posts & Pages
- Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- A Nice Example Related to the Frankl Conjecture
- The Trifference Problem
- Aubrey de Grey: The chromatic number of the plane is at least 5
- Sarkaria's Proof of Tverberg's Theorem 1
- Amazing: Karim Adiprasito proved the g-conjecture for spheres!
RSS
Monthly Archives: May 2019
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
19 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