/explore
|
You are here 
|
xenaproject.wordpress.com | ||
| | | | |
algorithmsoup.wordpress.com
The ``probabilistic method'' is the art of applying probabilistic thinking to non-probabilistic problems. Applications of the probabilistic method often feel like magic. Here is my favorite example: Theorem (Erdös, 1965). Call a set $latex {X}&fg=000000$ sum-free if for all $latex {a, b \in X}&fg=000000$, we have $latex {a + b \not\in X}&fg=000000$. For any finite... |
|
| | | | | ||
| | | | |
terrytao.wordpress.com
I've just uploaded to the arXiv my preprint The maximal length of the Erd?s-Herzog-Piranian lemniscate in high degree. This paper resolves (in the asymptotic regime of sufficientl... |
|
| | | | | ||
| | | | |
yufeizhao.wordpress.com
Ashwin Sah Ashwin Sah just proved a new upper bound to diagonal Ramsey numbers. See his preprint on the arXiv. This is the first improvement since Conlon's upper bound published in Annals of Math in 2009, which in turn built on earlier work of Thomason (1988). Obtaining asymptotics of Ramsey numbers is perhaps the central... |
|
| | | | | ||
| | | | |
rapuran.wordpress.com
[AI summary] A blog post discussing a weekly photo challenge featuring a descent-themed image, with reader comments and archive links. |
|
| | | |||
