|
You are here |
emanueleviola.wordpress.com | ||
| | | | |
rhubbarb.wordpress.com
|
|
| | | | | My previous post was written with the help of a few very useful tools: LaTeX mathematical typesetting Gummi LaTeX editor Python programming language PyX Python / LaTeX graphics package my own PyPyX wrapper around PyX LaTeX2WP script for easy conversion from LaTeX to WordPress HTML | |
| | | | |
algorithmsoup.wordpress.com
|
|
| | | | | In this post, I want to tell you about what I think might be the world's simplest interesting algorithm. The vertex cover problem. Given a graph $latex {G = (V, E)}&fg=000000$, we want to find the smallest set of vertices $latex {S \subseteq V}&fg=000000$ such that every edge $latex {e \in E}&fg=000000$ is covered by... | |
| | | | |
mathematicaloddsandends.wordpress.com
|
|
| | | | | I recently came across this theorem on John Cook's blog that I wanted to keep for myself for future reference: Theorem. Let $latex f$ be a function so that $latex f^{(n+1)}$ is continuous on $latex [a,b]$ and satisfies $latex |f^{(n+1)}(x)| \leq M$. Let $latex p$ be a polynomial of degree $latex \leq n$ that interpolates... | |
| | | | |
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... | ||