/explore
|
You are here 
|
juliawolffenotes.home.blog | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
alanrendall.wordpress.com
In a previous post I discussed the Brouwer fixed point theorem and I mentioned the fact that it applies to any non-empty closed bounded convex subset of a Euclidean space, since a subset of this kind is homeomorphic to a closed ball in a Euclidean space. However I did not prove the latter statement. I... |
|
| | | | | ||
| | | | |
anuragbishnoi.wordpress.com
In the previous post, we saw the problem of determining the asymptotic growth of the function $latex T_L(n)$, which is the largest size of vector subspace $latex C \subseteq \mathbb{F}_3^n$, with the property that for any three distinct vectors $latex u, v, w$ in $latex C$, there is a coordinate $latex i$, such that $latex... |
|
| | | | | ||
| | | | |
uncommongenders.home.blog
There is lettragender! -Admin Opal |
|
| | | |||
