Rectangular Kronecker coefficients and plethysms in geometric complexity theory
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12167
- Type
- D - Journal article
- DOI
-
10.1016/j.aim.2017.08.024
- Title of journal
- Advances in Mathematics
- Article number
- -
- First page
- 40
- Volume
- 319
- Issue
- -
- ISSN
- 0001-8708
- Open access status
- Technical exception
- Month of publication
- August
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 11
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of this paper was published at FOCS 2016. It is shown that the original Mulmuley-Sohoni approach cannot prove superpolynomial lower bounds on the determinantal complexity of the permanent. This is a major setback for the whole geometric complexity theory program, documented for example in the changes that had to be implemented in Aaronson's P vs NP survey article (2016). Mulmuley himself explains in "Geometric Complexity Theory V: Efficient Algorithms For Noether Normalization" (JAMS 2017) that his research direction has to be changed in the light of this paper.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -