Recent Comments
Matthew D Cory on November’s Lectures, 202… jamesmessig on November’s Lectures, 202… Gil Kalai on Quantum Computers: A Brief Ass… Quantum Computers: A… on November’s Lectures, 202… Matthew D Cory on November’s Lectures, 202… jamesmessig on November’s Lectures, 202… Matthew D Cory on November’s Lectures, 202… Gil Kalai on November’s Lectures, 202… jamesmessig on November’s Lectures, 202… Gil Kalai on November’s Lectures, 202… Matthew D Cory on November’s Lectures, 202… Matthew D Cory on November’s Lectures, 202… -
Recent Posts
- Combinatorial Morning in Tel Aviv, Sunday 28/12/2025
- November’s Lectures, 2025
- Ten Recent Questions for ChatGPT
- A Visit to the Israeli Quantum Computing Center (IQCC)
- Computational Complexity and Explanations in Physics
- Kazhdan Seminar fall 2025 – Starting Today Oct. 19, 2026.
- Explicit Lossless Vertex Expanders!
- Dror Bar-Natan and Roland Van der Veen – A Fast, Strong, and Fun knot invariant!
- Polynomial Bounds for Chowla’s Cosine Problem
Top Posts & Pages
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- Combinatorial Morning in Tel Aviv, Sunday 28/12/2025
- TYI 30: Expected number of Dice throws
- Hong Wang and Joshua Zahl's Solution for the Kakeya Problem in Three Dimensions - Reflections and Links
- What is the maximum number of Tverberg's partitions?
- ChatGPT Meets Elchanan Mossel's Dice Problem
- Navier-Stokes Fluid Computers
- Seven Problems Around Tverberg's Theorem
- Touching Simplices and Polytopes: Perles' argument
RSS
Monthly Archives: May 2021
To Cheer You Up in Difficult times 24: Borodin’s colouring conjecture!
An acyclic colouring of a graph is a colouring of its vertices so that the subgraph spanned on union of every two colour classes is acyclic (a forest). Grunbaum conjectured in 1973 that Every planar graph has acyclic colouring with … Continue reading
To cheer you up in difficult times 25: some mathematical news! (Part 2)
Topology Quasi-polynomial algorithms for telling if a knot is trivial Marc Lackenby announced a quasi-polynomial time algorithm to decide whether a given knot is the unknot! This is a big breakthrough. This question is known to be both in NP … Continue reading
Posted in Algebra, Combinatorics, Geometry, Number theory
4 Comments
To cheer you up in difficult times 23: the original hand-written slides of Terry Tao’s 2015 Einstein Lecture in Jerusalem
In 2015 Terry Tao gave the Einstein lecture of the Israeli Academy for Science and Humanities. We got hold of the original signed hand-written slides of Terry’s lecture and we are happy to share them with you. The title of … Continue reading
Posted in Analysis, Applied mathematics, Computer Science and Optimization, Physics, What is Mathematics
Tagged Terence Tao
1 Comment
Alef Corner: ICM2022
Alef’s new piece for ICM 2022 will surely cheer you up!