Recent Comments
-
Recent Posts
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky’s conjectures
- Nostalgia corner: John Riordan’s referee report of my first paper
- At the Movies III: Picture a Scientist
- At the Movies II: Kobi Mizrahi’s short movie White Eye makes it to the Oscar’s short list.
- And the Oscar goes to: Meir Feder, Zvi Reznic, Guy Dorman, and Ron Yogev
- Thomas Vidick: What it is that we do
- To cheer you up in difficult times 20: Ben Green presents super-polynomial lower bounds for off-diagonal van der Waerden numbers W(3,k)
- To cheer you up in difficult times 19: Nati Linial and Adi Shraibman construct larger corner-free sets from better numbers-on-the-forehead protocols
- Possible future Polymath projects (2009, 2021)
Top Posts & Pages
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky's conjectures
- The Argument Against Quantum Computers - A Very Short Introduction
- Possible future Polymath projects (2009, 2021)
- 8866128975287528³+(-8778405442862239)³+(-2736111468807040)³
- TYI 30: Expected number of Dice throws
- Jean
- Photonic Huge Quantum Advantage ???
- ICM 2018 Rio (3) - Coifman, Goldstein, Kronheimer and Mrowka, and the Four Color Theorem
- Dan Romik on the Riemann zeta function
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
17 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