Recent Comments
-
Recent Posts
- The Trifference Problem
- Greatest Hits 2015-2022, Part II
- Greatest Hits 2015-2022, Part I
- Tel Aviv University Theory Fest is Starting Tomorrow
- Alef’s Corner
- A Nice Example Related to the Frankl Conjecture
- Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
- Barnabás Janzer: Rotation inside convex Kakeya sets
- Inaugural address at the Hungarian Academy of Science: The Quantum Computer – A Miracle or Mirage
Top Posts & Pages
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- A Nice Example Related to the Frankl Conjecture
- TYI 30: Expected number of Dice throws
- The Trifference Problem
- Sarkaria's Proof of Tverberg's Theorem 1
- Aubrey de Grey: The chromatic number of the plane is at least 5
RSS
Monthly Archives: September 2021
To Cheer You Up in Difficult Times 31: Federico Ardila’s Four Axioms for Cultivating Diversity
Todos Cuentan (Everybody counts) In a beautiful NAMS 2016 article Todos Cuentan: Cultivating Diversity in Combinatorics, Federico Ardila put forward four thoughtful axioms which became a useful foundation for Ardila’s own educational and outreach efforts, and were offered as a pressing … Continue reading
Posted in Academics, Combinatorics, What is Mathematics, Women in science
Tagged diversity, Federico Ardila
13 Comments
Dream a Little Dream: Quantum Computer Poetry for the Skeptics (Part I, mainly 2019)
Stars shining bright above you, Night breezes seem to whisper “I love you” Birds singing in the sycamore tree. Dream a little dream. (YouTube) Greetings from NYC everybody! Peter Shor pioneered (Nov 26, 2019) quantum poetry for the skeptics over … Continue reading
To Cheer you up in difficult times 30: Irit Dinur, Shai Evra, Ron Livne, Alex Lubotzky, and Shahar Mozes Constructed Locally Testable Codes with Constant Rate, Distance, and Locality
The Simons Institute announces an October 6, 2021 lecture by Irit Dinur with the result in the title. This is a wonderful breakthrough. I am glad to mention that I have altogether 170 combined years of friendships with the authors. … Continue reading
Posted in Combinatorics, Computer Science and Optimization
Tagged Alex Lubotzky, Irit Dinur, Ron Livne, Shahar Mozes, Shai Evra
5 Comments