Recent Comments

Recent Posts
 Polymath 10 post 6: The ErdosRado sunflower conjecture, and the Turan (4,3) problem: homological approaches.
 Polymath 10 Emergency Post 5: The ErdosSzemeredi Sunflower Conjecture is Now Proven.
 Mind Boggling: Following the work of Croot, Lev, and Pach, Jordan Ellenberg settled the cap set problem!
 More Math from Facebook
 The Erdős Szekeres polygon problem – Solved asymptotically by Andrew Suk.
 The Quantum Computer Puzzle @ Notices of the AMS
 Three Conferences: Joel Spencer, April 2930, Courant; Joel Hass May 2022, Berkeley, Jean Bourgain May 2124, IAS, Princeton
 Math and Physics Activities at HUJI
 Stefan Steinerberger: The Ulam Sequence
Top Posts & Pages
 Polymath 10 Emergency Post 5: The ErdosSzemeredi Sunflower Conjecture is Now Proven.
 Mind Boggling: Following the work of Croot, Lev, and Pach, Jordan Ellenberg settled the cap set problem!
 A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
 Polymath 10 post 6: The ErdosRado sunflower conjecture, and the Turan (4,3) problem: homological approaches.
 The KadisonSinger Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
 Believing that the Earth is Round When it Matters
 Telling a Simple Polytope From its Graph
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Two Math Riddles
RSS
Monthly Archives: January 2009
Mathematics, Science, and Blogs
Michael Nielsen wrote a lovely essay entitled “Doing science online” about mathematics, science, and blogs. Michael’s primary example is a post over Terry Tao’s blog about the NavierStokes equation and he suggests blogs as a way of scaling up scientific conversation. Michael is writing … Continue reading
Posted in Blogging, What is Mathematics
Tagged Blogs, Michael Nielsen, Open science, polymath1, Tim Gowers
5 Comments
Test Your Intuition (3)
Let be the dimensional cube. Turn into a torus by identifying opposite facets. What is the minumum dimensional volume of a subset of which intersects every nontrivial cycle in .
News
I just saw in “Shtetl Optimized” that the LinialNisan conjecture regarding circuits have been proved by Mark Braverman. Scott’s post describes the conjecture as well as related open problems in computational complexity. (Scott offers $100 for a proof that Fourier … Continue reading
Posted in Computer Science and Optimization
3 Comments
Noise
What is the correct picture of our world? Are noise and errors part of the essence of matters, and the beautiful perfect patterns we see around us, as well as the notions of information and computation, are just derived concepts … Continue reading
Posted in Philosophy
7 Comments
IPAM Fall 2009
Combinatorics: Methods and Applications in Mathematics and Computer Science September 8 – December 11, 2009 Scientific overview: Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas. It studies discrete objects and their properties. … Continue reading
Posted in Conferences, Updates
Leave a comment
Telling a Simple Polytope From its Graph
Peter Mani (a photograph by Emo Welzl) Simple polytopes, puzzles Micha A. Perles conjectured in the ’70s that the graph of a simple polytope determines the entire combinatorial structure of the polytope. This conjecture was proved in 1987 by Blind … Continue reading
Posted in Convex polytopes, Open problems
Tagged Eric Friedman, Peter Mani, Roswitta Blind
5 Comments
The Retaliation Game
We have two players playing in turns. Each player can decide to stop in which case the game is stopped and the two players can go on with their lives, or to act. The player that acts gains and … Continue reading
Links and Comments
The link L10n74 (click on the picture to see L10n74’s Braid representation, its Morse link presentation, its Alexander and Jones polynomials, its Khovanov homology, and more, much more.) Here are some links and further comments regarding the last four posts. (Mainly … Continue reading