Explore >> Select a destination
|
You are here 
|
terrytao.wordpress.com | ||
| | | | |
almostsuremath.com
|
|
| | | | | In today's post, I investigate a simple recurrence relation and show how it is possible to describe its behaviour asymptotically at large times. The relation describing how the series evolves at a time n will depend both on its value at the earlier time n/2 and on whether n is even or odd, which, as... | |
| | | | |
ilaba.wordpress.com
|
|
| | | | | The Coven-Meyerowitz conjecture is a tentative characterization of finite sets that tile the integers by translations. It's also something I have been thinking about, on and off, for more than 2 decades; in the last few years, Itay Londner and I were finally able to make some progress on it. This post will provide a... | |
| | | | |
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,... | |
| | | | |
chicagoterrainfactory.wordpress.com
|
|
| | | Armoured Vendels from Medbury. | ||
