/explore
|
You are here 
|
lucatrevisan.wordpress.com | ||
| | | | |
gowers.wordpress.com
|
|
| | | | | Here is a simple but important fact about bipartite graphs. Let $latex G$ be a bipartite graph with (finite) vertex sets $latex X$ and $latex Y$ and edge density $latex \alpha$ (meaning that the number of edges is $latex \alpha |X||Y|$). Now choose $latex (x_1,x_2)$ uniformly at random from $latex X^2$ and $latex (y_1,y_2)$ uniformly | |
| | | | |
gilkalai.wordpress.com
|
|
| | | | | 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 | |
| | | | |
gilkalai.wordpress.com
|
|
| | | | | Topology Quasi-polynomial algorithms for telling if a knot is trivial Marc Lackenby announced a quasi-polynomial time algorithm to decide whether a given knot is the unknot! This is a big breakthrough. This question is known to be both in NP and in coNP. See this post, and updates there in the comment section. Topology seminar,... | |
| | | | |
marcospereira.me
|
|
| | | In this post we summarize the math behind deep learning and implement a simple network that achieves 85% accuracy classifying digits from the MNIST dataset. | ||
