- Alef Corner: Math Collaboration
- Alef’s Corner: Math Collaboration 2
- To cheer you up in difficult times 11: Immortal Songs by Sabine Hossenfelder and by Tom Lehrer
- To cheer you up in difficult times 10: Noam Elkies’ Piano Improvisations and more
- Quantum Matters
- To cheer you up in difficult times 9: Alexey Pokrovskiy proved that Rota’s Basis Conjecture holds asymptotically
- To Cheer you up in Difficult Times 8: Nathan Keller and Ohad Klein Proved Tomaszewski’s Conjecture on Randomly Signed Sums
- Noam Lifshitz: A new hypercontractivity inequality — The proof!
- To cheer you up in difficult times 7: Bloom and Sisask just broke the logarithm barrier for Roth’s theorem!
Top Posts & Pages
- TYI 30: Expected number of Dice throws
- Quantum Matters
- Gil's Collegial Quantum Supremacy Skepticism FAQ
- To Cheer you up in Difficult Times 8: Nathan Keller and Ohad Klein Proved Tomaszewski's Conjecture on Randomly Signed Sums
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- A sensation in the morning news - Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- Hoi Nguyen and Melanie Wood: Remarkable Formulas for the Probability that Projections of Lattices are Surjective
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
Tag Archives: Turan’s problem
Polymath 10 post 6: The Erdos-Rado sunflower conjecture, and the Turan (4,3) problem: homological approaches.
In earlier posts I proposed a homological approach to the Erdos-Rado sunflower conjecture. I will describe again this approach in the second part of this post. Of course, discussion of other avenues for the study of the conjecture are welcome. The purpose … Continue reading
Cocycles Definition: A -cocycle is a collection of -subsets such that every -set contains an even number of sets in the collection. Alternative definition: Start with a collection of -sets and consider all -sets that contain an odd number of members … Continue reading
Turan’s problem asks for the minimum number of triangles on n vertices so that every 4 vertices span a triangle. (Or equivalently, for the maximum number of triangles on n vertices without a “tetrahedron”, namely without having four triangles on … Continue reading
I will write a little about how hectic things are now here at HU, and make two (somewhat related) follow-ups on previous posts: Tell you about Turan’s problem, and about Balázs Szegedi’s lecture from Marburg dealing with limits of graphs and hypergraphs. Local Events … Continue reading
The “basic notion seminar” is an initiative of David Kazhdan who joined HU math department around 2000. People give series of lectures about basic mathematics (or not so basic at times). Usually, speakers do not talk about their own research and not even … Continue reading