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		quomodocumque.wordpress.com Sphere packing, cap set, and the Turán problem are all the same thing \| Quomodocumque
\|	\|	andrea.corbellini.name Elliptic Curve Cryptography: finite fields and discrete logarithms - Andrea Corbellini	5.2 parsecs away Travel
\|	\|	[AI summary] A technical blog post explaining elliptic curves over finite fields, covering modular arithmetic, point addition algorithms, cyclic subgroups, and the discrete logarithm problem in the context of cryptography.	5.2 parsecs away Travel
\|	\|	anuragbishnoi.wordpress.com The Rank-Ramsey problem \| Anurag's Math Blog	3.1 parsecs away Travel
\|	\|	The Ramsey number $latex R(s, t)$ is the smallest $latex n$ such that every graph on $latex \geq n$ vertices either contains a clique of size $latex s$ or an independent set of size $latex t$. Ramsey's theorem implies that these numbers always exist, and determining them (precisely or asymptotically) has been a major challenge...	3.1 parsecs away Travel
\|	\|	0fps.net Conway's Game of Life for Curved Surfaces (Part 2) - 0 FPS	5.0 parsecs away Travel
\|	\|	(This is the sequel to the following post on SmoothLife. For background information go there, or read Stephan Rafler's paper on SmoothLife here.) Last time, we talked about an interesting generalization of Conway's Game of Life and walked through the details of how it was derived, and investigated some strategies for discretizing it. Today, let's...	5.0 parsecs away Travel
\|	\|	degoes.net A Glossary of Functional Programming - John A De Goes	20.1 parsecs away Travel
\|		Functional programming has a bit of jargon, but that doesn't have to stop you from understanding core concepts	20.1 parsecs away Travel