On geometric complexity theory: multiplicity obstructions are stronger than occurrence obstructions

DOI10.4230/LIPICS.ICALP.2019.51MaRDI QIDQ5091206zbMATH OpenFDO

Authors Julian Dörfler, Christian Ikenmeyer, Greta Panova

Publication date 21 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2019.51

zbMATH Keywords

algebraic complexity theorygeometric complexity theorymultiplicity obstructionsoccurrence obstructionsplethysm coefficientsWaring rank

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• On geometric complexity theory: multiplicity obstructions are stronger than occurrence obstructions
• No occurrence obstructions in geometric complexity theory
• Geometric complexity theory and matrix powering
• Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
• Padded polynomials, their cousins, and geometric complexity theory

Cites work

• Algorithms in invariant theory
• Brill's equations as a \(\mathrm{GL}(V)\)-module
• Explicit lower bounds via geometric complexity theory
• Geometric complexity theory and tensor rank
• Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
• Geometric complexity theory. I: An approach to the P vs. NP and related problems
• Geometry and complexity theory
• scientific article; zbMATH DE number 1001729 (Why is no real title available?)
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 44019 (Why is no real title available?)
• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 1503622 (Why is no real title available?)
• scientific article; zbMATH DE number 1431596 (Why is no real title available?)
• scientific article; zbMATH DE number 7204282 (Why is no real title available?)
• Lie groups. An approach through invariants and representations
• No occurrence obstructions in geometric complexity theory
• On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
• Padded polynomials, their cousins, and geometric complexity theory
• Permanent versus determinant: not via saturations
• Rectangular Kronecker coefficients and plethysms in geometric complexity theory
• Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH
• Strict unimodality of \(q\)-binomial coefficients
• Symmetrizing tableaux and the 5th case of the Foulkes conjecture
• Symmetry, Representations, and Invariants
• The complexity of computing Kronecker coefficients

Cited in

(1)

• No occurrence obstructions in geometric complexity theory

This page was built for publication: On geometric complexity theory: multiplicity obstructions are stronger than occurrence obstructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091206)