1h

revised 
Simple question: different definitions of Bousfield localization
fixed typos 
1h

answered  Simple question: different definitions of Bousfield localization 
14h

reviewed  Leave Open Bound that random walk stays within with constant probability? 
14h

reviewed  Leave Closed heat equation in 2D with absorbing and reflecting boundary conditions 
18h

reviewed  Approve enumeration tag wiki excerpt 
1d

comment 
General approaches to extension theorems as Caratheodory
Great question. I have no idea how to answer it, but I hope someone comes along and does 
Nov
21 
reviewed  Reviewed How to compute the arithmetic genus of a nonreduced curve? 
Nov
17 
comment 
What are the implications of the new quasipolynomial time solution for the Graph Isomorphism problem?
In comment #110 at Scott's blog, Greg Kuperberg mentions the Uknottedness problem and says "The news this month over graph isomorphism suggests that one day we might see a fast algorithm for determining whether a knot diagram represents the unknot." This is not an answer to (2) as much as the three examples above, but is close. 
Nov
17 
revised 
What are the implications of the new quasipolynomial time solution for the Graph Isomorphism problem?
added 458 characters in body 
Nov
17 
comment 
What are the implications of the new quasipolynomial time solution for the Graph Isomorphism problem?
The description of the string isomorphism problem on Scott Aaronson's blog reminds me of the word problem. I wonder if there might be an application of Babai's ideas to finding faster solutions to the word problem for groups where it's solvable, or increasing the class of groups on which it's solvable. I suppose we won't know till we see Babai's preprint. 
Nov
17 
answered  What are the implications of the new quasipolynomial time solution for the Graph Isomorphism problem? 
Nov
16 
awarded  Popular Question 
Nov
13 
awarded  Good Question 
Nov
12 
comment 
Definition of Left Operadic Kan Extension for $\infty$operads
No, I mean you should just copy and paste what he wrote into the answer field below and then accept it (so you answer your own question, with an acknowledgment to Aaron). To make an answer CW just click the box in the corner. 
Nov
12 
revised 
What are the implications of the new quasipolynomial time solution for the Graph Isomorphism problem?
added 112 characters in body 
Nov
12 
awarded  Nice Question 
Nov
12 
comment 
Definition of Left Operadic Kan Extension for $\infty$operads
If so, then I think the right thing to do is post it as CW, accept it, and don't leave this one unanswered. 
Nov
12 
comment 
What are the implications of the new quasipolynomial time solution for the Graph Isomorphism problem?
@DelioMugnolo: Thanks. I had the Trevisan link from 11/03 where he announces the result, but had not seen the one from 11/05. It sounds like Graph Isomorphism cannot be NPcomplete, which is good to know. 
Nov
12 
revised 
What are the implications of the new quasipolynomial time solution for the Graph Isomorphism problem?
added 14 characters in body 
Nov
12 
comment 
What are the implications of the new quasipolynomial time solution for the Graph Isomorphism problem?
@GerhardPaseman: Yes, you're right that I had misunderstood something there. I was thinking of log(n^k) not log(n)^k. Having it as n^{f(n,k)} makes the term "quasipolynomial" make much more sense. Thanks! 