Recent Comments
mathematicalsilence on The Ramanujan Challenge for… Gil Kalai on Polymath Plus AI Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Gil Kalai on Matching in NC and Local … rohitgurjar0 on Matching in NC and Local … Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Vijay Vazirani on Matching in NC and Local … Gil Kalai on Matching in NC and Local … Matching in NC and L… on Open problem session of HUJI-C… -
Recent Posts
- The Ramanujan Challenge for AI
- Matching in NC and Local Events
- A sensational Ramsey breakthrough by Domagoj Bradač (reblogged from Sam Mattheus’ blog)
- Three Interviews
- Amazing: Erdős’ Unit Distance Problem was Disproved! It was achieved by AI!
- Polymath Plus AI
- Starting Today: Kazhdan Sunday seminar: “Boolean Functions, Hypercontractivity, and Applications”
- Scott Aaronson’s View of my View About Quantum Computing
- The Fully Depolarizing Noise Conjecture for Physical Cat States is Twenty Years Old!
Top Posts & Pages
- The Ramanujan Challenge for AI
- יופיה של המתמטיקה
- The Polynomial Hirsch Conjecture: Discussion Thread
- Polymath 3: Polynomial Hirsch Conjecture
- A Few Slides and a Few Comments From My MIT Lecture on Quantum Computers
- Polymath10: The Erdos Rado Delta System Conjecture
- Polymath 3: The Polynomial Hirsch Conjecture 2
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- Why Quantum Computers Cannot Work: The Movie!
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
5 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!