Explore >> Select a destination
|
You are here 
|
anuragbishnoi.wordpress.com | ||
| | | | |
www.jeremykun.com
|
|
| | | | | I'm pleased to announce that another paper of mine is finished. This one just got accepted to MFCS 2014, which is being held in Budapest this year (this whole research thing is exciting!). This is joint work with my advisor, Lev Reyzin. As with my first paper, I'd like to explain things here on my blog a bit more informally than a scholarly article allows. A Recent History of Graph Coloring One of the first important things you learn when you study graphs is that coloring graphs is hard. | |
| | | | |
mattbaker.blog
|
|
| | | | | In my previous post, I presented a proof of the existence portion of the structure theorem for finitely generated modules over a PID based on the Smith Normal Form of a matrix. In this post, I'd like to explain how the uniqueness portion of that theorem is actually a special case of a more general... | |
| | | | |
juliawolffenotes.home.blog
|
|
| | | | | Recently Terry Tao posted to the arXiv his paper Almost all Collatz orbits attain almost bounded values, which caused quite the stir on social media. For instance, this Reddit post about it is only a day old and already has nearly a thousand upvotes; Twitter is abuzz with tweets like Tim Gowers': (this sentiment seems... | |
| | | | |
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,... | ||
