- 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
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Why Quantum Computers Cannot Work: The Movie!
- Two Math Riddles
- A Few Mathematical Snapshots from India (ICM2010)
- Jim Geelen, Bert Gerards, and Geoﬀ Whittle Solved Rota's Conjecture on Matroids
- Rodica Simion: Immigrant Complex
- Analysis of Boolean Functions
Search Results for: erdos
This post follows a recent paper On sunflowers and matrix multiplication by Noga Alon, Amir Spilka, and Christopher Umens (ASU11) which rely on an earlier paper Group-theoretic algorithms for matrix multiplication, by Henry Cohn, Robert Kleinberg, Balasz Szegedy, and Christopher Umans (CKSU05), … Continue reading
The Question Suppose that you want to send a message so that it will reach all vertices of the discrete -dimensional cube. At each time unit (or round) you can send the message to one vertex. When a vertex gets the … Continue reading
Greetings to all! Karol Borsuk conjectured in 1933 that every bounded set in can be covered by sets of smaller diameter. In a previous post I described the counterexample found by Jeff Kahn and me. I will devote a few posts … Continue reading
Elementary school reunion: Usually, I don’t write about personal matters over the blog, but having (a few weeks ago) an elementary school reunion after 42 years was a moving and exciting event as to consider making an exception. For now, … Continue reading
Polymath is a collective open way of doing mathematics. It started over Gowers’s blog with the polymath1 project that was devoted to the Density Hales Jewett problem. Since then we had Polymath2 related to Tsirelson spaces in Banach space theory , an intensive Polymath4 devoted … Continue reading
Yaacov Kupitz and Micha A. Perles asked: What is the smallest number C such that for every configuration of n points in the plane there is a line containing two or more points from the configuration for which the difference between the … Continue reading
Polymath5 – The Erdős discrepancy problem – is on its way. Update: Gowers’s theoretical post marking the official start of Polymath 5 appeared. Update (February 2014): Boris Konev and Alexei Lisitsa found a sequence of length 1160 of discrepancy 2 … Continue reading
Polymath4 is devoted to a question about derandomization: To find a deterministic polynomial time algorithm for finding a k-digit prime. So I (belatedly) devote this post to derandomization and, in particular, the following four problems. 1) Find a deterministic algorithm for primality 2) Find … 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
Update: This is a third of three posts (part I, part II) proposing some extensions of the cap set problem and some connections with the Frankl Rodl theorem. Here is a post presenting the problem on Terry Tao’s blog (March 2007). Here … Continue reading