- Mathematical news to cheer you up
- To Cheer You Up in Difficult Times 28: Math On the Beach (Alef’s Corner)
- To cheer you up in difficult times 27: A major recent “Lean” proof verification
- To cheer you up in difficult times 26: Two real-life lectures yesterday at the Technion
- To Cheer You Up in Difficult times 24: Borodin’s colouring conjecture!
- To cheer you up in difficult times 25: some mathematical news! (Part 2)
- To cheer you up in difficult times 23: the original hand-written slides of Terry Tao’s 2015 Einstein Lecture in Jerusalem
- Alef Corner: ICM2022
- The probabilistic proof that 2^400-593 is a prime: a revolutionary new type of mathematical proof, or not a proof at all?
Top Posts & Pages
- Mathematical news to cheer you up
- The Argument Against Quantum Computers - A Very Short Introduction
- A sensation in the morning news - Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
- To cheer you up in difficult times 27: A major recent "Lean" proof verification
- Zur Luria on the n-Queens Problem
- To Cheer You Up in Difficult Times 28: Math On the Beach (Alef's Corner)
- The Quantum Fault-Tolerance Debate Updates
- Around Borsuk’s Conjecture 3: How to Save Borsuk's conjecture
- To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
Category Archives: Combinatorics
1. Anna Kiesenhofer, a PhD mathematician researching PDEs at Ecole Polytechnique Federale Lausanne (EPFL), won the gold medal in the women’s bicycle road race at the Olympics. Here are two trivia question: a) Which hero of a recent post over … Continue reading
After 16 months without lecturing to an audience in my same location, I gave yesterday two lectures at the Technion in front of a live audience (and some additional audience in remote locations). The main lecture was in COMSOC 2021, … Continue reading
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
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
Alef’s new piece for ICM 2022 will surely cheer you up!
To cheer you up, in these difficult times, here are (in two parts) some mathematical news that I heard in personal communications or on social media. (Maybe I will write later, in more details, about few of them that are … Continue reading
The Abel Prize was awarded earlier today to László Lovász and Avi Wigderson “for their foundational contributions to theoretical computer science and discrete mathematics, and their leading role in shaping them into central fields of modern mathematics.” Congratulations to Laci … Continue reading
In 1971/1972 academic year, I was an undergraduate student at the Hebrew University of Jerusalem and toward the end of the year I wrote a paper about Abel’s sums. I sent it to John Riordan the author of the books … Continue reading
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)
What will be the next polymath project? click here for our post about it. New lower bounds for van der Waerden numbers by Ben Green Abstract: We show that there is a red-blue colouring of [N] with no blue 3-term … Continue reading
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
What will be the next polymath project? click here for our previous post. Number on the forehead, communication complexity, and additive combinatorics Larger Corner-Free Sets from Better NOF Exactly-N Protocols, by Nati Linial and Adi Shraibman Abstract: A subset of … Continue reading