Timeline for What are the current breakthroughs of Geometric Complexity Theory?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 8 at 19:44 | history | made wiki | Post Made Community Wiki by Stefan Kohl♦ | ||
| Nov 5, 2021 at 21:00 | history | edited | Abdelmalek Abdesselam | CC BY-SA 4.0 |
edited body
|
| May 14, 2019 at 22:10 | history | edited | Abdelmalek Abdesselam | CC BY-SA 4.0 |
corrected some math statements
|
| Sep 10, 2017 at 14:57 | comment | added | Abdelmalek Abdesselam | @JoshuaGrochow: Oups! You are right I misspelt your name. I hope it's fixed now. Given how often people massacre my name I am certainly sensitized to this issue. My apologies. | |
| Sep 10, 2017 at 14:55 | history | edited | Abdelmalek Abdesselam | CC BY-SA 3.0 |
fixed name spelling
|
| Sep 5, 2017 at 21:01 | comment | added | Abdelmalek Abdesselam | @JoshuaGrochow: Thank you for your comments. Regarding the Valiant Conjecture I would say I am pessimistic across the board as far as methods. As I said in my answer knowing multiplicities for the ideal of the determinant should help narrowing the search for separating modules. Although in the 1,2,3 approach above that's not so essential. One can perhaps graphically construct some concomitant and show it vanishes on the det even though it might actually be identically zero! On can procrastinate as I said and defer showing one actually has a nonzero concomitant to step 3): nonvanishing on perm | |
| Sep 5, 2017 at 20:25 | comment | added | Joshua Grochow | Also, even if you are pessimistic about actually resolving Valiant's Conjecture using multiplicity obstructions, studying and learning more about the multiplicities seems like it could still be a useful guide to finding separating modules (that is, it could help you hone in on which isomorphism types of G-modules to be looking for, and therefore what kind of concomitants might possibly be used to separate). | |
| Sep 5, 2017 at 20:23 | comment | added | Joshua Grochow | It's worth noting that the rank of the Hessian is precisely what's used to get the current best lower bound on perm v det, namely $n^2 / 2$ see Mignon-Ressayre, Cai-Chen-Li (comput. complex. 2010) and Landsberg-Manivel-Ressayre. (Also, two small things: you misspelled my name :), and you can link to the final journal version dx.doi.org/10.1007/s00037-015-0103-x since it's open access - it's updated quite a bit from the original arXiv post.) | |
| Aug 4, 2017 at 15:04 | history | edited | Abdelmalek Abdesselam | CC BY-SA 3.0 |
added 525 characters in body
|
| Aug 3, 2017 at 14:34 | history | edited | Abdelmalek Abdesselam | CC BY-SA 3.0 |
added 759 characters in body
|
| Aug 2, 2017 at 22:08 | history | answered | Abdelmalek Abdesselam | CC BY-SA 3.0 |