- To cheer you up in difficult times 6: Play Rani Sharim’s two-player games of life, read Maya Bar-Hillel presentation on catching lies with statistics, and more.
- To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
- To cheer you up in difficult times 4: Women In Theory present — I will survive
- To cheer you up in difficult times 3: A guest post by Noam Lifshitz on the new hypercontractivity inequality of Peter Keevash, Noam Lifshitz, Eoin Long and Dor Minzer
- Harsanyi’s Sweater
- To cheer you up in difficult times II: Mysterious matching news by Gal Beniamini, Naom Nisan, Vijay Vazirani and Thorben Tröbst!
- Trees not Cubes! Memories of Boris Tsirelson
- A small update from Israel and memories from Singapore: Partha Dasgupta, Robin Mason, Frank Ramsey, and 007
- Game Theory – on-line Course at IDC, Herzliya
Top Posts & Pages
- Game Theory 2020
- 'Gina Says'
- TYI 30: Expected number of Dice throws
- The seventeen camels riddle, and Noga Alon's camel proof and algorithms
- Dan Romik on the Riemann zeta function
- To cheer you up in difficult times 6: Play Rani Sharim's two-player games of life, read Maya Bar-Hillel presentation on catching lies with statistics, and more.
- Scott Triumphs* at the Shtetl
- The story of Poincaré and his friend the baker
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
Tag Archives: Paul Erdos
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
Paul Erdős in Jerusalem, 1933 1993 Update: Here is a link to a draft of a paper* based on the first part of this lecture. Some old and new problems in combinatorial geometry I: Around Borsuk’s problem. I just came back from … Continue reading