Rectangular Kronecker coefficients and plethysms in geometric complexity theory
From MaRDI portal
Publication:2404629
DOI10.1016/j.aim.2017.08.024zbMath1388.68088arXiv1512.03798OpenAlexW2750308922MaRDI QIDQ2404629
Greta Panova, Christian Ikenmeyer
Publication date: 19 September 2017
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.03798
Representations of finite symmetric groups (20C30) Representation theory for linear algebraic groups (20G05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
The classification of multiplicity-free plethysms of Schur functions, Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science, On vanishing of Kronecker coefficients, Polynomial total positivity and high relative accuracy through Schur polynomials, Splitting Kronecker squares, 2-decomposition numbers, Catalan combinatorics, and the Saxl conjecture, Interview with Greta Panova, Schur polynomials do not have small formulas if the determinant does not, Counting Partitions inside a Rectangle, On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions, Obstructions to combinatorial formulas for plethysm, On the complexity of the permanent in various computational models, Unnamed Item, Unnamed Item, No occurrence obstructions in geometric complexity theory, Maximal lexicographic spectra and ranks for states with fixed uniform margins, Geometric complexity theory V: Efficient algorithms for Noether normalization, Breaking down the reduced Kronecker coefficients, On Various Multiplicity-Free Products of Schur Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binary determinantal complexity
- Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient
- Unimodality via Kronecker products
- Kronecker coefficients for one hook shape
- Even partitions in plethysms.
- Nonvanishing of Kronecker coefficients for rectangular shapes.
- The complexity of computing the permanent
- On rectangular Kronecker coefficients.
- Quadratic lower bound for permanent vs. determinant in any characteristic
- Permanent versus determinant, obstructions, and Kronecker coefficients
- Kronecker products, characters, partitions, and the tensor square conjectures
- Partitions into odd, unequal parts
- Formulas for the expansion of the Kronecker products \(S_{(m,n)} \otimes{}S_{(1^{p-r},r)}\) and \(S_{(1^ k2^ l)} \otimes{}S_{(1^{p-r},r)}\)
- On the Kronecker product of Schur functions of two row shapes
- The Kronecker product of Schur functions indexed by two-row shapes or hook shapes
- A formula for the Kronecker products of Schur functions of hook shapes
- Hypersurfaces with degenerate duals and the geometric complexity theory program
- A decomposition rule for certain tensor product representations of the symmetric groups
- Geometric complexity theory: an introduction for geometers
- The Saxl conjecture and the dominance order
- On the Durfee size of Kronecker products of characters of the symmetric group and its double covers.
- Characterizing Valiant's algebraic complexity classes
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
- A combinatorial interpretation for the coefficients in the Kronecker product \(s_{(n-p,p)} \ast s_\lambda\)
- Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
- Permanent versus determinant: Not via saturations
- An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $\mathbf{VP}\neq\mathbf{VNP}$
- On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect
- 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
- A simplified Kronecker rule for one hook shape
- Deciding Positivity of Littlewood--Richardson Coefficients
- Padded Polynomials, Their Cousins, and Geometric Complexity Theory
