You are here |
lucatrevisan.wordpress.com | ||
| | | |
terrytao.wordpress.com
|
|
| | | | Let $latex {G = (G,+)}&fg=000000$ be a finite additive group. A tiling pair is a pair of non-empty subsets $latex {A, B}&fg=000000$ such that every element of $latex {G}&fg=000000$ can | |
| | | |
eventuallyalmosteverywhere.wordpress.com
|
|
| | | | The second round of the British Mathematical Olympiad was taken yesterday by the 100 or so top scoring eligible participants from the first round, as well as some open entries. Qualifying for BMO2 is worth celebrating in its own right. The goal of the setters is to find the sweet spot of difficult but stimulating... | |
| | | |
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 | |
| | | |
extremal010101.wordpress.com
|
|
| | Suppose we want to understand under what conditions on $latex B$ we have $latex \begin{aligned} \mathbb{E} B(f(X), g(Y))\leq B(\mathbb{E}f(X), \mathbb{E} g(Y)) \end{aligned}$holds for all test functions, say real valued $latex f,g$, where $latex X, Y$ are some random variables (not necessarily all possible random variables!). If $latex X=Y$, i.e., $latex X$ and $latex Y$ are... |