On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions

DOI10.1137/19M1287638zbMath1455.68069arXiv1901.04576MaRDI QIDQ3295878

Julian Dörfler, Christian Ikenmeyer, Greta Panova

Publication date: 13 July 2020

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.04576

zbMATH Keywords

factorizationplethysmgeometric complexity theoryChow varietyFoulkes conjecturerepresentation-theoretic multiplicity

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Secant varieties, tensor rank, varieties of sums of powers (14N07)

Related Items (1)

Equations for GL invariant families of polynomials

Uses Software

• GitHub
• lowerbounds-survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strict unimodality of \(q\)-binomial coefficients
• Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH
• Symmetrizing tableaux and the 5th case of the Foulkes conjecture
• Brill's equations as a \(\mathrm{GL}(V)\)-module
• Algebraic Geometry. I: Complex projective varieties.
• Rectangular Kronecker coefficients and plethysms in geometric complexity theory
• On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
• Lie groups. An approach through invariants and representations
• Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
• Permanent versus determinant: Not via saturations
• Symmetry, Representations, and Invariants
• Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
• No occurrence obstructions in geometric complexity theory
• Geometry and Complexity Theory
• Padded Polynomials, Their Cousins, and Geometric Complexity Theory
• Geometric complexity theory and tensor rank
• Explicit lower bounds via geometric complexity theory
• Algorithms in invariant theory

This page was built for publication: On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions