/explore
|
You are here 
|
rjlipton.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... | |
| | | | |
thatsmaths.com
|
|
| | | | | The numbers are usually studied in layers of increasing subtlety and intricacy. We start with the natural, or counting, numbers $latex {\mathbb{N} = \{ 1, 2, 3, \dots \}}&fg=000000$. Then come the whole numbers or integers, $latex {\mathbb{Z} = \{ \dots, -2, -1, 0, 1, 2, \dots \}}&fg=000000$. All the ratios of these (avoiding division... | |
| | | | |
matheuscmss.wordpress.com
|
|
| | | | | Last November, I attended the beautiful conferencePrime Numbers, Determinism and PseudorandomnessatCIRM. This conference was originally prepared to celebrate the 60th birthday ofChristian Mauduit, but unfortunately a tragic event during the summer of 2019 made that this conference ended up becoming a celebration of the memory of Christian. The links to the titles, abstracts, slides and... | |
| | | | |
ergodicityeconomics.com
|
|
| | | |||
