Recent Comments
-
Recent Posts
- Peter Cameron: Doing research
- To cheer you up in difficult times 18: Beautiful drawings by Neta Kalai for my book: “Gina Says”
- Amazing: Simpler and more general proofs for the g-theorem by Stavros Argyrios Papadakis and Vasiliki Petrotou, and by Karim Adiprasito, Stavros Argyrios Papadakis, and Vasiliki Petrotou.
- Igor Pak: What if they are all wrong?
- To cheer you up in difficult times 17: Amazing! The Erdős-Faber-Lovász conjecture (for large n) was proved by Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus!
- Open problem session of HUJI-COMBSEM: Problem #5, Gil Kalai – the 3ᵈ problem
- To cheer you up in difficult times 16: Optimism, two quotes
- The Argument Against Quantum Computers – A Very Short Introduction
- Open problem session of HUJI-COMBSEM: Problem #4, Eitan Bachmat: Weighted Statistics for Permutations
Top Posts & Pages
- Peter Cameron: Doing research
- TYI 30: Expected number of Dice throws
- Amazing: Simpler and more general proofs for the g-theorem by Stavros Argyrios Papadakis and Vasiliki Petrotou, and by Karim Adiprasito, Stavros Argyrios Papadakis, and Vasiliki Petrotou.
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Igor Pak: What if they are all wrong?
- Chomskian Linguistics
- The Argument Against Quantum Computers - A Very Short Introduction
- To cheer you up in difficult times 18: Beautiful drawings by Neta Kalai for my book: "Gina Says"
- Dan Romik on the Riemann zeta function
RSS
Tag Archives: Alexandr Polyanskii
Recent progress on high dimensional Turan-Type problems by Andrey Kupavskii, Alexandr Polyanskii, István Tomon, and Dmitriy Zakharov and by Jason Long, Bhargav Narayanan, and Corrine Yap.
The extremal number for surfaces Andrey Kupavskii, Alexandr Polyanskii, István Tomon, Dmitriy Zakharov: The extremal number of surfaces Abstract: In 1973, Brown, Erdős and Sós proved that if is a 3-uniform hypergraph on vertices which contains no triangulation of the sphere, then … Continue reading
To cheer you up in complicated times – A book proof by Rom Pinchasi and Alexandr Polyanskii for a 1978 Conjecture by Erdős and Purdy!
Things do not look that good, and these are difficult times. But here on the blog we have plenty of things to cheer you up and assure you. And today we point to two book proofs — two book proofs … Continue reading
Posted in Combinatorics, Geometry, What is Mathematics
Tagged Alexandr Polyanskii, Rom Pinchasi
8 Comments