### Recent Comments

Philip Gibbs on Polymath10, Post 2: Homologica… Philip Gibbs on Polymath10, Post 2: Homologica… Philip Gibbs on Polymath10, Post 2: Homologica… Philip Gibbs on Polymath10, Post 2: Homologica… Gil Kalai on Polymath10, Post 2: Homologica… Philip Gibbs on Polymath10, Post 2: Homologica… Gil Kalai on Polymath10, Post 2: Homologica… gowers on Polymath10, Post 2: Homologica… GFP on Polymath10, Post 2: Homologica… domotorp on Polymath10, Post 2: Homologica… GFP on Polymath10, Post 2: Homologica… Philip Gibbs on Polymath10, Post 2: Homologica… -
### Recent Posts

- Polymath10, Post 2: Homological Approach
- Polymath10: The Erdos Rado Delta System Conjecture
- Convex Polytopes: Seperation, Expansion, Chordality, and Approximations of Smooth Bodies
- Igor Pak’s collection of combinatorics videos
- EDP Reflections and Celebrations
- Séminaire N. Bourbaki – Designs Exist (after Peter Keevash) – the paper
- Important formulas in Combinatorics
- Updates and plans III.
- NogaFest, NogaFormulas, and Amazing Cash Prizes

### Top Posts & Pages

- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- Polymath10, Post 2: Homological Approach
- Polymath10: The Erdos Rado Delta System Conjecture
- Believing that the Earth is Round When it Matters
- New Ramanujan Graphs!
- Analysis of Boolean Functions
- Can Category Theory Serve as the Foundation of Mathematics?
- Greatest Hits
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun

### RSS

# Category Archives: Open problems

## More Reasons for Small Influence

Readers of the big-league ToC blogs have already heard about the breakthrough paper An average-case depth hierarchy theorem for Boolean circuits by Benjamin Rossman, Rocco Servedio, and Li-Yang Tan. Here are blog reports on Computational complexity, on the Shtetl Optimized, and of Godel … Continue reading

## Coloring Simple Polytopes and Triangulations

Coloring Edge-coloring of simple polytopes One of the equivalent formulation of the four-color theorem asserts that: Theorem (4CT) : Every cubic bridgeless planar graph is 3-edge colorable So we can color the edges by three colors such that every two … Continue reading

## Jim Geelen, Bert Gerards, and Geoﬀ Whittle Solved Rota’s Conjecture on Matroids

Gian Carlo Rota Rota’s conjecture I just saw in the Notices of the AMS a paper by Geelen, Gerards, and Whittle where they announce and give a high level description of their recent proof of Rota’s conjecture. The 1970 conjecture asserts … Continue reading

Posted in Combinatorics, Open problems, Updates
Tagged Bert Gerards, Eric Katz, Geoﬀ Whittle, Gian Carlo Rota, Jim Geelen, June Huh, Matroids
7 Comments

## My Mathematical Dialogue with Jürgen Eckhoff

Jürgen Eckhoff, Ascona 1999 Jürgen Eckhoff is a German mathematician working in the areas of convexity and combinatorics. Our mathematical paths have met a remarkable number of times. We also met quite a few times in person since our first … Continue reading

Posted in Combinatorics, Convex polytopes, Open problems
Tagged Andy Frohmader, Helly's theorem, Jurgen Eckhoff, Nina Amenta, Noga Alon, Roy Meshulam
1 Comment

## Navier-Stokes Fluid Computers

Smart fluid Terry Tao posted a very intriguing post on the Navier-Stokes equation, based on a recently uploaded paper Finite time blowup for an averaged three-dimensional Navier-Stokes equation. The paper proved a remarkable negative answer for the regularity conjecture for a certain … Continue reading

## Amazing: Peter Keevash Constructed General Steiner Systems and Designs

Here is one of the central and oldest problems in combinatorics: Problem: Can you find a collection S of q-subsets from an n-element set X set so that every r-subset of X is included in precisely λ sets in the collection? … Continue reading

## Many triangulated three-spheres!

The news Eran Nevo and Stedman Wilson have constructed triangulations with n vertices of the 3-dimensional sphere! This settled an old problem which stood open for several decades. Here is a link to their paper How many n-vertex triangulations does the 3 … Continue reading

Posted in Combinatorics, Convex polytopes, Geometry, Open problems
Tagged Eran Nevo, Stedman Wilson
Leave a comment

## Polymath 8 – a Success!

Yitang Zhang Update (July 22, ’14). The polymath8b paper “Variants of the Selberg sieve, and bounded intervals containing many primes“, is now on the arXiv. See also this post on Terry Tao’s blog. Since the last update, we also had here … Continue reading

## Around Borsuk’s Conjecture 3: How to Save Borsuk’s conjecture

Borsuk asked in 1933 if every bounded set K of diameter 1 in can be covered by d+1 sets of smaller diameter. A positive answer was referred to as the “Borsuk Conjecture,” and it was disproved by Jeff Kahn and me in 1993. … Continue reading

## Poznań: Random Structures and Algorithms 2013

Michal Karonski (left) who built Poland’s probabilistic combinatorics group at Poznań, and a sculpture honoring the Polish mathematicians who first broke the Enigma machine (right, with David Conlon, picture taken by Jacob Fox). I am visiting now Poznań for the 16th … Continue reading

Posted in Combinatorics, Conferences, Open problems, Philosophy, Probability
Tagged Poznan, RSA
2 Comments