Outer Web | Explore

Explore >> Select a destination

You are here		terrytao.wordpress.com Some notes on the Coven-Meyerowitz conjecture \| What's new
\|	\|	qchu.wordpress.com Meditation on the Sylow theorems I \| Annoying Precision	3.5 parsecs away Travel
\|	\|	As an undergraduate the proofs I saw of the Sylow theorems seemed very complicated and I was totally unable to remember them. The goal of this post is to explain proofs of the Sylow theorems which I am actually able to remember, several of which use our old friend The $latex p$-group fixed point theorem...	3.5 parsecs away Travel
\|	\|	live-simons-blog.pantheonsite.io Theory at the Institute and Beyond, February 2025 \| Calvin Café: The Simons Institute Blog	4.2 parsecs away Travel
\|	\|	[AI summary] Recent advancements in the study of expander graphs, particularly Ramanujan graphs, have led to significant theoretical breakthroughs in understanding their properties and existence, with implications for computer science and mathematics.	4.2 parsecs away Travel
\|	\|	gilkalai.wordpress.com To cheer you up in difficult times 25: some mathematical news! (Part 2) \| Combinatorics and more	1.8 parsecs away Travel
\|	\|	Topology Quasi-polynomial algorithms for telling if a knot is trivial Marc Lackenby announced a quasi-polynomial time algorithm to decide whether a given knot is the unknot! This is a big breakthrough. This question is known to be both in NP and in coNP. See this post, and updates there in the comment section. Topology seminar,...	1.8 parsecs away Travel
\|	\|	shellsharks.com A Primer on Intel Assembly	31.5 parsecs away Travel
\|		An introduction to x86 Intel assembly.	31.5 parsecs away Travel