### Recent Comments

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… -
### Recent Posts

- 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

### RSS

# Monthly Archives: December 2012

## Lionel Pournin found a combinatorial proof for Sleator-Tarjan-Thurston diameter result

I just saw in Claire Mathieu’s blog “A CS professor blog” that a simple proof of the Sleator-Tarjan-Thurston’s diameter result for the graph of the associahedron was found by Lionel Pournin! Here are slides of his lecture “The diameters of associahedra” … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Convex polytopes
Tagged Associahedron, Lionel Pournin
1 Comment

## Postoctoral Positions Available

Maybe I should say that (like every year but even more so) we do have funding for 1-2 postdoctoral positions in combinatorics, for 1-3 years starting in the next academic year (the time is flexible) here at the Hebrew University … Continue reading

Posted in Updates
Leave a comment

## Dorit Aharonov’s on TEDx: A Feldenkrais lesson for the beginner scientist

Here is a lovely lecture starting with quantum computers, going through the Feldenkrais method, and ending with a mathematical puzzle. Click on the picture for the video of the talk. Here are Dorit’s four body-mind principles for learning: 1. Start … Continue reading

## Angry Bird Skepticism

Lenore Holditch is a freelance writer. Here is what she wrote to me: “I love learning about new topics, so I am confident that I can provide valuable content for your blog on any topic you wish, else I can … Continue reading

## The Privacy Paradox of Rann Smorodinsky

The following paradox was raised by Rann Smorodinsky: Rann Smorodinsky’s Privacy Paradox Suppose that you have the following one-time scenario. You want to buy a sandwich where the options are a roast beef sandwich or an avocado sandwich. Choosing … Continue reading