/explore
|
You are here 
|
terrytao.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 |
|
| | | | | ||
| | | | |
lucatrevisan.wordpress.com
I am writing a short survey on connections between additive combinatorics and computer science for SIGACT News and I have been wondering about the "history" of the connections. (I will be writing as little as possible about history in the SIGACT article, because I don't have the time to research it carefully, but if readers... |
|
| | | | | ||
| | | | |
rjlipton.com
A new way to write mathematics Vladimir Voevodsky won the Fields Medal in 2002 for his work on homotopy theory of algebraic varieties. Using his pioneering methods he proved, among many other things, a deep conjecture of John Milnor, that had been open for decades. Today I want to talk about, no, rant about, a... |
|
| | | | | ||
| | | | |
www.themathdoctors.org
|
|
| | | |||
