Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		blog.georgeshakan.com On the largest sum-free subset problem in the integers \| George Shakan
\|	\|	theoryofcomputing.org Matrix Approximation and Projective Clustering via Volume Sampling: Theory of Computing: An Open Access Electronic Journal in Theoretical Computer Science	3.7 parsecs away Travel
\|	\|		3.7 parsecs away Travel
\|	\|	algorithmsoup.wordpress.com My favorite example of: the probabilistic method - Algorithm Soup	1.9 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...	1.9 parsecs away Travel
\|	\|	pfzhang.wordpress.com Non-autonomous flow \| Pengfei's Notes	3.6 parsecs away Travel
\|	\|	Consider a smooth one-parameter family $latex {f_t}$ of diffeomorphisms on a manifold $latex M$. It is a flow if $latex f_0(x)=x$ and $latex f_{t}\circ f_{s}(x) = f_{s+t}(x)$ for every $latex x\in M$, , $latex t ,s \in \mathbb{R}$. Set $latex X(x)=\lim\limits_{h\to 0} \frac{1}{h}(f_h(x) - x)$. This generates a vector field $latex X: M \to TM$....	3.6 parsecs away Travel
\|	\|	textilinslag.wordpress.com Hello world! \| oidi	12.5 parsecs away Travel
\|		Welcome to WordPress.com. This is your first post. Edit or delete it and start blogging!	12.5 parsecs away Travel