/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
| | 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$....
| | 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
| |
| | thehighergeometer.wordpress.com
Small fun observation about finite topological spaces, and some challenges - theHigherGeometer
4.0 parsecs away

Travel
| | Here's a fun thing: if you want to generate a random finite $latex T_0$ space, instead select a random subset from $latex \mathbb{S}^n$, the $latex n$-fold power of the Sierpinski space $latex \mathbb{S}$, since every $latex T_0$ space embeds into some (arbitrary) product of copies of the Sierpinski space. (Recall that $latex \mathbb{S}$ has underlying...
| | quantumfrontiers.com
Now published: Building Quantum Computers | Quantum Frontiers
19.5 parsecs away

Travel
| Building Quantum Computers: A Practical Introduction by Shayan Majidy, Christopher Wilson, and Raymond Laflamme has been published by Cambridge University Press and will be released in the US on September 30. The authors invited me to write a Foreword for the book, which I was happy to do. The publisher kindly granted permission for me...