- Reflections: On the Occasion of Ron Adin’s and Yuval Roichman’s Birthdays, and FPSAC 2021
- ICM 2018 Rio (5) Assaf Naor, Geordie Williamson and Christian Lubich
- Test your intuition 47: AGC-GTC-TGC-GTC-TGC-GAC-GATC-? what comes next in the sequence?
- Cheerful news in difficult times: Richard Stanley wins the Steele Prize for lifetime achievement!
- Combinatorial Theory is Born
- To cheer you up in difficult times 34: Ringel Circle Problem solved by James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, and Bartosz Walczak
- Good Codes papers are on the arXiv
- To cheer you up in difficult times 33: Deep learning leads to progress in knot theory and on the conjecture that Kazhdan-Lusztig polynomials are combinatorial.
- The Logarithmic Minkowski Problem
Top Posts & Pages
- Navier-Stokes Fluid Computers
- The Intermediate Value Theorem Applied to Football
- TYI 30: Expected number of Dice throws
- Believing that the Earth is Round When it Matters
- To Cheer You Up in Difficult Times 31: Federico Ardila's Four Axioms for Cultivating Diversity
- Amazing: Karim Adiprasito proved the g-conjecture for spheres!
- 'Gina Says'
- To cheer you up in difficult times 27: A major recent "Lean" proof verification
- Happy Birthday Richard Stanley!
Tag Archives: Paul Erdos
The news: In 1981, Paul Erdős and András Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a graph with infinite chromatic number is necessarily infinite. Hong Liu and Richard Montgomery have just proved that … Continue reading
To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
Here is a piece of news that will certainly cheer you up: Florian Richter found A new elementary proof of the prime number theorem. (I thank Tami Ziegler for telling me about the new result.) From left to right: Atle Selberg, … Continue reading
Greetings from Oberwolfach. This week, there is a great meeting here on combinatorics. In this post I want to state the Brown-Erdős-Sós conjecture and one of its variants. The trigger was a beautiful talk I heard from Lior Gishboliner on … Continue reading
Three pictures, and a few related links. Van Vu Spoiler: In one of the most intense scenes, the protagonist, with his bare hands and against all odds, took care of the mighty Wigner semi-circle law in two different ways. (From … Continue reading
Next week Igor Pak will give the 2018 Erdős Lectures (delayed from June) Here is the poster Combinatorics — Erdos lecture: Igor Pak (UCLA) “Counting linear extensions” Monday December 10 11:00-13:00 Location: IIAS Hall 130, Feldman building, Givat Ram … Continue reading
Peter Frankl (right) and Zoltan Furedi The news A new paper by Nathan Keller and Noam Lifshitz settles several open problems in extremal combinatorics for wide range of parameters. Those include the three problems we mention next. Three central open … Continue reading
Jozsef Solymosi is Giving the 2017 Erdős Lectures in Discrete Mathematics and Theoretical Computer Science
May 4 2:30-3:30; May 7 11:00-13:00; May 10 10:30-12:00 See the event webpage for titles and abstracts (or click on the picture below).
The purpose of this post is to start the polymath10 project. It is one of the nine projects (project 3d) proposed by Tim Gowers in his post “possible future polymath projects”. The plan is to attack Erdos-Rado delta system conjecture also known as the … Continue reading
The Problem In 1932, Erdős conjectured: Erdős Discrepancy Conjecture (EDC) [Problem 9 here] For any constant , there is an such that the following holds. For any function , there exists an and a such that For any , … Continue reading