/explore
|
You are here 
|
11011110.github.io | ||
| | | | |
yufeizhao.wordpress.com
This post is adapted from my new expository survey Extremal regular graphs: independent sets and graph homomorphisms. The earliest result in extremal graph theory is usually credited to Mantel, who proved, in 1907, that a graph on $latex {n}$ vertices with no triangles contains at most $latex {n^2/4}$ edges, where the maximum is achieved for... |
|
| | | | | ||
| | | | |
reasonabledeviations.com
Academic blog about quantitative finance, programming, maths. |
|
| | | | | ||
| | | | |
ptreview.sublinear.info
[AI summary] This post summarizes five recent academic papers on property testing, sublinear time algorithms, and theoretical computer science, covering topics like tolerant independent set testing, private distribution testing, mass estimation in conditional sampling motifs, and streaming lower bounds for max-cut. |
|
| | | | | ||
| | | | |
wildtopology.com
Let $latex \mathbb{E}=\bigcup_{n\in\mathbb{N}}C_n$ where $latex C_n$ is the circle of radius $latex 1/n$ with basepoint $latex b_0=(0,0)$. Let $latex \sigma:\mathbb{E}\to\mathbb{E}$ be the shift map, which takes $latex C_n$ homeomorphically onto $latex C_{n+1}$. The earring mapping torus is the mapping torus $latex T_f$ of the map $latex f$. In particular, $latex T_f=\mathbb{E}\times [0,1]/\sim$ where $latex (x,0)\sim... |
|
| | | |||
