- Mathematical Gymnastics
- Media Item from “Haaretz” Today: “For the first time ever…”
- Jim Geelen, Bert Gerards, and Geoﬀ Whittle Solved Rota’s Conjecture on Matroids
- Media items on David, Amnon, and Nathan
- Next Week in Jerusalem: Special Day on Quantum PCP, Quantum Codes, Simplicial Complexes and Locally Testable Codes
- Happy Birthday Ervin, János, Péter, and Zoli!
- My Mathematical Dialogue with Jürgen Eckhoff
- Test Your Intuition (23): How Many Women?
- Happy Birthday Richard Stanley!
Top Posts & Pages
- Believing that the Earth is Round When it Matters
- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- Why Quantum Computers Cannot Work: The Movie!
- Mathematical Gymnastics
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Polymath 8 - a Success!
- When It Rains It Pours
- The Polynomial Hirsch Conjecture: Discussion Thread
- Emmanuel Abbe: Erdal Arıkan's Polar Codes
Monthly Archives: July 2009
I can see three main avenues toward making progress on the Polynomial Hirsch conjecture. One direction is trying to improve the upper bounds, for example, by looking at the current proof and trying to see if it is wasteful and if so where … Continue reading
The Abstract Polynomial Hirsch Conjecture A convex polytope is the convex hull of a finite set of points in a real vector space. A polytope can be described as the intersection of a finite number of closed halfspaces. Polytopes have … Continue reading
Who is the most beautiful queen of cards? Opinions vary. From Gina Says part 2 How to debate Beauty [cosmic variance. Gina Says: May 10th, 2007 at 6:18 am ] The issue of beauty and physics is quite prominent … Continue reading
Download the second part of my book “Gina Says.” Link to the post with the first part. “Gina Says,” Adventures in the Blogosphere String War selected and edited by Gil Kalai Praise for “Gina Says” After having … Continue reading
The time has come to prove that the number of edges in every finite tree is one less than the number of vertices (a tree is a connected graph with no cycle). The proof is by induction, but first you need … Continue reading
You are guaranteed to win one of the following five prizes, the letter says. (And it is completely free! Just 6 dollars shipping and handling.) a) a high-definition huge-screen TV, b) a video camera, c) a yacht, d) a decorative … Continue reading
This post is continued here. Eddie Kim and Francisco Santos have just uploaded a survey article on the Hirsch Conjecture. The Hirsch conjecture: The graph of a d-polytope with n vertices facets has diameter at most n-d. We devoted several … Continue reading
Update (July 24): A detailed new article in Hebrew and English. Dr. Leora Meridor, who replaced Dov Lautman in March (just four months ago) as chair of TAU’s executive council is quoted saying: ” I’d give him (Zvi Galil) a list … Continue reading
Last week I took part in a lovely and impressive conference on the state of geometry and functional analysis, celebrating Vitali Milman’s 70th birthday. The conference started in Tel Aviv, continued at the Dead Sea, and returned to Tel Aviv. I gave a … Continue reading