Explore >> Select a destination
|
You are here 
|
mattbaker.blog | ||
| | | | |
fabricebaudoin.blog
|
|
| | | | | In this lecture, we studySobolev inequalities on Dirichlet spaces. The approach we develop is related to Hardy-Littlewood-Sobolev theory The link between the Hardy-Littlewood-Sobolev theory and heat kernel upper bounds is due to Varopoulos, but the proof I give below I learnt it from my colleague RodrigoBañuelos. It bypasses the Marcinkiewicz interpolation theorem,that was originally used... | |
| | | | |
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... | |
| | | | |
mikespivey.wordpress.com
|
|
| | | | | The Riemann zeta function $latex \zeta(s)$ can be expressed as $latex \zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s}$, for complex numbers s whose real part is greater than 1. By analytic continuation, $latex \zeta(s)$ can be extended to all complex numbers except where $latex s = 1$. The power sum $latex S_a(M)$ is given by $latex S_a(M) =... | |
| | | | |
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... | ||
