Explore >> Select a destination
|
You are here 
|
www.jeremykun.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... | |
| | | | |
awwalker.com
|
|
| | | | | Classification theorems of Euler, Lagrange, and Legendre describe the sets of integers that can be written as the sum of 2, 3, and 4 squares. In the last two cases, it follows easily that the density of these sets are 5/6 and 1. The question of density is not so simple in the case of... | |
| | | | |
djalil.chafai.net
|
|
| | | | | The logarithmic potential is a classical object of potential theory intimately connected with the two dimensional Laplacian. It appears also in free probability theory via the free entropy, and in partial differential equations e.g. Patlak-Keller-Segel models. This post concerns only it usage for the spectra of non Hermitian random matrices. Let \( {\mathcal{P}(\mathbb{C})} \) be the set of probability measures... | |
| | | | |
cgad.ski
|
|
| | | |||
