You are here |
www.math.columbia.edu | ||
| | | |
gilkalai.wordpress.com
|
|
| | | | 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,... | |
| | | |
4gravitons.com
|
|
| | | | Perimeter, like most institutes of theoretical physics, divides their researchers into semi-informal groups. At Perimeter, these are: Condensed Matter Cosmology Mathematical Physics Particle Physics Quantum Fields and Strings Quantum Foundations Quantum Gravity Quantum Information Strong Gravity I'm in the Quantum Fields and Strings group, which many people seem to refer to simply as the String... | |
| | | |
terrytao.wordpress.com
|
|
| | | | Don't just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary? Is the converse true? What happens in the classical sp... | |
| | | |
ianwrightsite.wordpress.com
|
|
| | Riemann's Zeta function is an infinite sublation of Hegelian integers. |