Explore >> Select a destination
|
You are here 
|
rjlipton.com | ||
| | | | |
terrytao.wordpress.com
|
|
| | | | | [This post is dedicated to Luca Trevisan, who recently passed away due to cancer. Though far from his most significant contribution to the field, I would like to mention that, as with most of my ot... | |
| | | | |
blog.computationalcomplexity.org
|
|
| | | | | In my post about the myth that Logicians are crazy I mentioned in passing that Whitehead and Russell spend 300 pages proving 1+1=2 (but we... | |
| | | | |
terrytao.wordpress.com
|
|
| | | | | Let $latex {G = (G,+)}&fg=000000$ be a finite additive group. A tiling pair is a pair of non-empty subsets $latex {A, B}&fg=000000$ such that every element of $latex {G}&fg=000000$ can | |
| | | | |
terrytao.wordpress.com
|
|
| | | Building on the interest expressed in the comments to this previous post, I am now formally proposing to initiate a Polymath project on the topic of obtaining new upper bounds on the | ||
