Outer Web | Explore

Explore >> Select a destination

You are here		dustingmixon.wordpress.com Polymath16, sixteenth thread: Writing the paper and chasing down loose ends, II - Short, Fat Matrices
\|	\|	gowers.wordpress.com Frankl's union-closed conjecture - a possible Polymath project? \| Gowers's Weblog	4.9 parsecs away Travel
\|	\|	Although it was from only a couple of people, I had an enthusiastic response to a very tentative suggestion that it might be rewarding to see whether a polymath project could say anything useful about Frankl's union-closed conjecture. A potentially worrying aspect of the idea is that the problem is extremely elementary to state, does...	4.9 parsecs away Travel
\|	\|	gilkalai.wordpress.com Aubrey de Grey: The chromatic number of the plane is at least 5 \| Combinatorics and more	4.8 parsecs away Travel
\|	\|	A major progress on an old standing beautiful problem.Aubrey de Grey proved that the chromatic number of the plane is at least 5. (I first heard about it from Alon Amit.) TheHadwigerNelson problem asks for the minimum number of colors required to color theplanesuch that no twopointsat distance one from each other have the	4.8 parsecs away Travel
\|	\|	terrytao.wordpress.com Polymath proposal: upper bounding the de Bruijn-Newman constant \| What's new	5.5 parsecs away Travel
\|	\|	Building on the interest expressed in the comments to this previous post, I am now formally proposing to initiate a Polymath project on the topic of obtaining new upper bounds on the	5.5 parsecs away Travel
\|	\|	www.livescience.com Quantum computing will make cryptography obsolete. But computer scientists are working to make them unhackable. \| Live Science	33.4 parsecs away Travel
\|		When quantum computers become commonplace, current cryptographic systems will become obsolete. Scientists are racing to get ahead of the problem and keep our data secure.	33.4 parsecs away Travel