On vanishing of Kronecker coefficients
From MaRDI portal
Publication:1686840
DOI10.1007/s00037-017-0158-yzbMath1382.68093arXiv1507.02955OpenAlexW1894723027MaRDI QIDQ1686840
Ketan D. Mulmuley, Michael Walter, Christian Ikenmeyer
Publication date: 18 December 2017
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.02955
Combinatorial aspects of representation theory (05E10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
The Horn inequalities from a geometric point of view, Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory, Bounds on Kronecker coefficients via contingency tables, Quantum mechanics of bipartite ribbon graphs: integrality, lattices and Kronecker coefficients, Necessary conditions for the positivity of Littlewood-Richardson and plethystic coefficients, Combinatoric topological string theories and group theory algorithms, Covering \(\mathsf{Irrep}(S_n)\) with tensor products and powers, The quantum detection of projectors in finite-dimensional algebras and holography, Tensor models, Kronecker coefficients and permutation centralizer algebras, Hilbert functions of certain rings of invariants via representations of the symmetric groups (with an appendix by Dejan Govc), Fundamental invariants of orbit closures, No occurrence obstructions in geometric complexity theory, On the Symmetries of and Equivalence Test for Design Polynomials., Vanishing of Littlewood-Richardson polynomials is in P, On the local cohomology of L-shaped integral FI-modules, Breaking down the reduced Kronecker coefficients, Integrality, duality and finiteness in combinatoric topological strings, Membership in Moment Polytopes is in NP and coNP, All-orders asymptotics of tensor model observables from symmetries of restricted partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric invariant theory and generalized eigenvalue problem. II
- Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient
- Kronecker coefficients for one hook shape
- Nonvanishing of Kronecker coefficients for rectangular shapes.
- Permanent versus determinant, obstructions, and Kronecker coefficients
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
- Gauss maps and plethysm
- Inequalities for moment cones of finite-dimensional representations
- Plane partitions and characters of the symmetric group
- Convexity properties of the moment mapping. III
- Computation of dilated Kronecker coefficients
- Rectangular Kronecker coefficients and plethysms in geometric complexity theory
- On P vs. NP and geometric complexity theory
- A Note on Sparse Complete Sets
- 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
- On Isomorphisms and Density of $NP$ and Other Complete Sets
- The honeycomb model of $GL_n(\mathbb C)$ tensor products I: Proof of the saturation conjecture
- Coadjoint orbits, moment polytopes, and the Hilbert-Mumford criterion
- Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients
- A study of the representations supported by the orbit closure of the determinant
- Reducibility among Combinatorial Problems
- Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem
- Membership in Moment Polytopes is in NP and coNP
- Padded Polynomials, Their Cousins, and Geometric Complexity Theory
- Explicit lower bounds via geometric complexity theory
- On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
