Timeline for Counting knots with fixed number of crossings
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 30, 2010 at 1:18 | comment | added | Sam Nead | @Scott - I did say it was an (over)estimate. :) My bound is of the order $n^n$ while the reality of the situation is more like an exponential (which I wasn't aware of). I've voted up Steven's answer. Hmmm. I will point out that my answer is elementary... | |
| Mar 29, 2010 at 22:47 | comment | added | Scott Carter | The over-estimate is way too large! Once you get beyond 17 crossings the probability that the code will not be planar is way too large. | |
| Mar 29, 2010 at 22:22 | vote | accept | Paolo Aceto | ||
| Mar 29, 2010 at 22:22 | |||||
| Mar 29, 2010 at 19:07 | history | answered | Sam Nead | CC BY-SA 2.5 |