Explore >> Select a destination
|
You are here 
|
xenaproject.wordpress.com | ||
| | | | |
jiggerwit.wordpress.com
|
|
| | | | | What follows are the opening paragraphs of a pdf document giving an argument for controlled natural languages in mathematics. At the recent Big Proof 2 conference in Edinburgh, I realized that a case must be made for developing a controlled natural language for mathematics. There is little consensus on this issue, and mathematicians and computer... | |
| | | | |
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... | |
| | | | |
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... | |
| | | | |
theupsizers.wordpress.com
|
|
| | | https://www.amazon.com/dp/B0D8T7D7QV | ||
