Outer Web | Explore

Explore >> Select a destination

You are here		gilkalai.wordpress.com Ilan Karpas: Frankl's Conjecture for Large Families \| Combinatorics and more
\|	\|	algorithmsoup.wordpress.com My favorite example of: the probabilistic method - Algorithm Soup	11.2 parsecs away Travel
\|	\|	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...	11.2 parsecs away Travel
\|	\|	fabricebaudoin.blog Lecture notes: A short introduction to Dirichlet spaces \| Research and Lecture notes	9.1 parsecs away Travel
\|	\|	Here are the lecture notes of the minicourse given at NYU Abu Dhabi. DirichletDownload	9.1 parsecs away Travel
\|	\|	thehousecarpenter.wordpress.com Notes on proving the completeness theorem for propositional logic \| The House Carpenter	9.3 parsecs away Travel
\|	\|	NB: I've opted to just get straight to the point with this post rather than attempting to introduce the subject first, so it may be of little interest to readers who aren't already interested in proving the completeness theorem for propositional logic. A PDF version of this document is available here. The key thing I...	9.3 parsecs away Travel
\|	\|	clutterreport.wordpress.com Christmas decorations 2024 (7) \| The Clutter Reports	16.1 parsecs away Travel
\|		attempting to clean up my living and workspace	16.1 parsecs away Travel