Giving a talk at Eli… on Academic Degrees and Sex Johan Aspegren on To Cheer You Up in Difficult T… To cheer you up in d… on Another sensation – Anni… Gil Kalai on To Cheer You Up in Difficult T… Gil Kalai on To Cheer You Up in Difficult T… Alexander Barvinok on To Cheer You Up in Difficult T… Kevin on To Cheer You Up in Difficult T… Gil Kalai on To Cheer You Up in Difficult T… Arseniy on To Cheer You Up in Difficult T… Alexander Barvinok on To Cheer You Up in Difficult T… uniform on To Cheer You Up in Difficult T… Arseniy on To Cheer You Up in Difficult T…
- Giving a talk at Eli and Ricky’s geometry seminar. (October 19, 2021)
- To cheer you up in difficult times 32, Annika Heckel’s guest post: How does the Chromatic Number of a Random Graph Vary?
- To Cheer You Up in Difficult Times 31: Federico Ardila’s Four Axioms for Cultivating Diversity
- Dream a Little Dream: Quantum Computer Poetry for the Skeptics (Part I, mainly 2019)
- 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
- To cheer you up in difficult times 29: Free will, predictability and quantum computers
- Alef’s corner: Mathematical research
- Let me tell you about three of my recent papers
- Mathematical news to cheer you up
Top Posts & Pages
- Giving a talk at Eli and Ricky's geometry seminar. (October 19, 2021)
- Academic Degrees and Sex
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- The Argument Against Quantum Computers - A Very Short Introduction
- To Cheer You Up in Difficult Times 31: Federico Ardila's Four Axioms for Cultivating Diversity
- Richard Stanley: How the Proof of the Upper Bound Theorem (for spheres) was Found
- To cheer you up in difficult times 32, Annika Heckel's guest post: How does the Chromatic Number of a Random Graph Vary?
- Amazing: Karim Adiprasito proved the g-conjecture for spheres!
- TYI 30: Expected number of Dice throws
Monthly Archives: January 2009
Michael Nielsen wrote a lovely essay entitled “Doing science online” about mathematics, science, and blogs. Michael’s primary example is a post over Terry Tao’s blog about the Navier-Stokes equation and he suggests blogs as a way of scaling up scientific conversation. Michael is writing … Continue reading
Let be the -dimensional cube. Turn into a torus by identifying opposite facets. What is the minumum -dimensional volume of a subset of which intersects every non-trivial cycle in .
I just saw in “Shtetl Optimized” that the Linial-Nisan conjecture regarding circuits have been proved by Mark Braverman. Scott’s post describes the conjecture as well as related open problems in computational complexity. (Scott offers $100 for a proof that Fourier … Continue reading
What is the correct picture of our world? Are noise and errors part of the essence of matters, and the beautiful perfect patterns we see around us, as well as the notions of information and computation, are just derived concepts … Continue reading
Combinatorics: Methods and Applications in Mathematics and Computer Science September 8 – December 11, 2009 Scientific overview: Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas. It studies discrete objects and their properties. … Continue reading
The solution to the last riddle is:
Peter Mani (a photograph by Emo Welzl) Simple polytopes, puzzles Micha A. Perles conjectured in the ’70s that the graph of a simple -polytope determines the entire combinatorial structure of the polytope. This conjecture was proved in 1987 by Blind … Continue reading
What is this?