### 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
- 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
- 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 11: Immortal Songs by Sabine Hossenfelder and by Tom Lehrer
- Must-read book by Avi Wigderson
- Richard Stanley: How the Proof of the Upper Bound Theorem (for spheres) was Found
- TYI 30: Expected number of Dice throws

### RSS

# Monthly Archives: January 2021

## Possible future Polymath projects (2009, 2021)

What will be our next polymath project? A polymath project (Wikipedia) is a collaboration among mathematicians to solve important and difficult mathematical problems by coordinating many mathematicians to communicate with each other on finding the best route to the solution. … Continue reading

Posted in Combinatorics, Mathematics over the Internet, Open discussion
Tagged polymath, Polymath proposals, Tim Gowers
30 Comments

## Peter Cameron: Doing research

Originally posted on Peter Cameron's Blog:

Probably every research mathematician has been asked the question, “How do you do mathematical research?” Some lay people think we simply figure out ways of doing bigger and bigger long multiplications. Many more…

## To cheer you up in difficult times 18: Beautiful drawings by Neta Kalai for my book: “Gina Says”

In 2009 I wrote a book “Gina Says” that appeared here on the blog, about the adventures of “Gina” in the blogsphere. In 2017 the book (edited and shortened a little) appeared in “world scientific.” The most important additions were … Continue reading

## 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.

Stavros Argyrios Papadakis, Vasiliki Petrotou, and Karim Adiprasito In 2018, I reported here about Karim Adiprasito’s proof of the g-conjecture for simplicial spheres. This conjecture by McMullen from 1970 was considered a holy grail of algebraic combinatorics and it resisted … Continue reading

Posted in Algebra, Combinatorics, Geometry
Tagged g-conjecture, Hilda Geiringer, Karim Adiprasito, Stavros Argyrios Papadakis, Vasiliki Petrotou
5 Comments

## Igor Pak: What if they are all wrong?

Originally posted on Igor Pak's blog:

Conjectures are a staple of mathematics. They are everywhere, permeating every area, subarea and subsubarea. They are diverse enough to avoid a single general adjective. They come in al shapes and sizes. Some…

Posted in Combinatorics, Computer Science and Optimization, Geometry, What is Mathematics
Tagged Igor Pak
7 Comments

## 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!

Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus have just uploaded a paper to the arXive, A proof of the Erdős-Faber-Lovász conjecture. (I am thankful to Nati Linial and Ryan Alweiss for telling me about it.) … Continue reading

Posted in Combinatorics, Updates
Tagged Abhishek Methuku, Daniela Kühn, Deryk Osthus, Dong Yeap Kang, Erdos-Faber-Lovasz conjecture, Tom Kelly
4 Comments

## Open problem session of HUJI-COMBSEM: Problem #5, Gil Kalai – the 3ᵈ problem

This post continues to describe problems presented at our open problems session back in November 2020. Here is the first post in the series. Today’s problem was presented by me, and it was an old 1989 conjecture of mine. A … Continue reading

## To cheer you up in difficult times 16: Optimism, two quotes

A timely quote “If there’s so much shit around, there has to be a pony somewhere.” Arundhati Roy, The God of Small Things and Give me a couple of years free from other duties, and I shall complete the task … Continue reading