/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

 polymathprojects.org
(Research thread V) Determinstic way to find primes | The polymath blog
| | lucatrevisan.wordpress.com
Earliest Connections of Additive Combinatorics and Computer Science | in theory
5.2 parsecs away

Travel
| | I am writing a short survey on connections between additive combinatorics and computer science for SIGACT News and I have been wondering about the "history" of the connections. (I will be writing as little as possible about history in the SIGACT article, because I don't have the time to research it carefully, but if readers...
| | terrytao.wordpress.com
Some notes on the Coven-Meyerowitz conjecture | What's new
3.5 parsecs away

Travel
| | Let $latex {G = (G,+)}&fg=000000$ be a finite additive group. A tiling pair is a pair of non-empty subsets $latex {A, B}&fg=000000$ such that every element of $latex {G}&fg=000000$ can
| | qchu.wordpress.com
The man who knew partition asymptotics | Annoying Precision
4.5 parsecs away

Travel
| | (Part I of this post ishere) Let $latex p(n)$ denote the partition function, which describes the number of ways to write $latex n$ as a sum of positive integers, ignoring order. In 1918 Hardy and Ramanujan proved that $latex p(n)$ is given asymptotically by $latex \displaystyle p(n) \approx \frac{1}{4n \sqrt{3}} \exp \left( \pi \sqrt{ \frac{2n}{3}...
| | fabricebaudoin.blog
H-type structures | Research and Lecture notes
26.9 parsecs away

Travel
| In two works in collaboration with Erlend Grong, Gianmarco Molino and Luca Rizzi, we introduced the notion of H-type structure: H-type foliations Comparison theorems on H-type sub-Riemannian manifolds Consider a triple $latex (\mathbb{M}, \mathcal{H}, g)$ where $latex \mathbb{M}$ is a manifold, $latex \mathcal{H}$ a constant rank sub-bundle of the tangent bundle of $latex T \mathbb{M}$...