Permanent versus determinant: Not via saturations
From MaRDI portal
Publication:2951164
DOI10.1090/proc/13310zbMath1360.14117arXiv1501.05528OpenAlexW1921398896MaRDI QIDQ2951164
Jesko Hüttenhain, Peter Bürgisser, Christian Ikenmeyer
Publication date: 29 December 2016
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.05528
Representation theory for linear algebraic groups (20G05) Geometric invariant theory (14L24) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Related Items (8)
Rectangular Kronecker coefficients and plethysms in geometric complexity theory ⋮ Vanishing symmetric Kronecker coefficients ⋮ Splitting Kronecker squares, 2-decomposition numbers, Catalan combinatorics, and the Saxl conjecture ⋮ Symmetrizing tableaux and the 5th case of the Foulkes conjecture ⋮ On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions ⋮ Fundamental invariants of orbit closures ⋮ Unnamed Item ⋮ No occurrence obstructions in geometric complexity theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binary determinantal complexity
- Strict unimodality of \(q\)-binomial coefficients
- Even partitions in plethysms.
- Nonvanishing of Kronecker coefficients for rectangular shapes.
- Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH
- Séminaire d'algèbre Paul Dubreil et Marie-Paule Malliavin. Proceedings, Paris 1986
- Colorings and orientations of graphs
- Stable properties of plethysm: On two conjectures of Foulkes
- Proof of the Alon-Tarsi conjecture for \(n=2^rp\)
- Completeness and reduction in algebraic complexity theory
- Computational invariant theory
- Algebraic Geometry. I: Complex projective varieties.
- Geometric complexity theory: an introduction for geometers
- Secants of minuscule and cominuscule minimal orbits
- A lower bound for the determinantal complexity of a hypersurface
- Characterizing Valiant's algebraic complexity classes
- Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
- An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $\mathbf{VP}\neq\mathbf{VNP}$
- Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
- A study of the representations supported by the orbit closure of the determinant
- The Conjectures of Alon–Tarsi and Rota in Dimension Prime Minus One
- Padded Polynomials, Their Cousins, and Geometric Complexity Theory
This page was built for publication: Permanent versus determinant: Not via saturations
