Timeline for Fundamental domain for symmetric group $S_n$ acting on $\mathop{Gr}(k,n)$?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 7, 2010 at 17:47 | comment | added | Dylan Thurston | I knew a different reduction from graph isomorphism, but this is an interesting one. (And I'm not only interested in generic points; a fundamental domain should include edge cases.) | |
| May 7, 2010 at 13:25 | comment | added | David E Speyer | Graph isomorphism is not expected to be NP-complete; if it is, the polynomial hierarchy collapses. See qwiki.stanford.edu/wiki/Complexity_Zoo:G#gi | |
| May 7, 2010 at 12:40 | comment | added | Johannes Hahn | Isn't graph isomorphism NP-complete? How can there be a "quite fast" algorithm for that? | |
| May 7, 2010 at 11:41 | history | answered | David E Speyer | CC BY-SA 2.5 |