Explore >> Select a destination
|
You are here 
|
terrytao.wordpress.com | ||
| | | | |
rjlipton.com
|
|
| | | | | Another proof idea using finite automata Steve Cook proved three landmark theorems with 1971 dates. The first has been called a "surprising theorem": that any deterministic pushdown automaton with two-way input tape can be simulated in linear time by a random-access machine. This implies that string matching can be done in linear time, which inspired... | |
| | | | |
gilkalai.wordpress.com
|
|
| | | | | Gowers, Green, Manners and Tao. They reminded me of the A-team of the 1980s television series: "If you have a problem, if no one else can help, and if you can find them, maybe you can hire... the A-Team." A conjecture of Marton, widely known as "the polynomial Freiman-Ruzsa conjecture" was certainly a holy grail | |
| | | | |
gilkalai.wordpress.com
|
|
| | | | | A geometric graph is a set of points in the plane (vertices) and a set of line segments between certain pairs of points (edges). A geometric graph is simple if the intersection of two edges is empty or a vertex of both. A geometric graph is convex if the vertices are in convex position. A... | |
| | | | |
www.jeremykun.com
|
|
| | | This proof assumes knowledge of complex analysis, specifically the notions of analytic functions and Liouville's Theorem (which we will state below). The fundamental theorem of algebra has quite a few number of proofs (enough to fill a book!). In fact, it seems a new tool in mathematics can prove its worth by being able to prove the fundamental theorem in a different way. This series of proofs of the fundamental theorem also highlights how in mathematics there are many many ways to prove a single theorem... | ||
