The complexity of computing Kronecker coefficients

Authors Peter Bürgisser, Christian Ikenmeyer

Publication date 29 August 2018

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAJ0131

computational complexity tensor products Kronecker coefficients representations of symmetric groups

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of representation theory (05E10) Ordinary representations and characters (20C15) Representations of finite symmetric groups (20C30)

Recommendations

On the complexity of computing Kronecker coefficients
On vanishing of Kronecker coefficients
Breaking down the reduced Kronecker coefficients
On rectangular Kronecker coefficients.
Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH

Cited in

(24)

Plane partitions and the combinatorics of some families of reduced Kronecker coefficients
scientific article; zbMATH DE number 7561544 (Why is no real title available?)
Covering \(\mathsf{Irrep}(S_n)\) with tensor products and powers
On the complexity of computing Kronecker coefficients
Irreducible modules for symmetric groups that are summands of their exterior square
On geometric complexity theory: multiplicity obstructions are stronger than occurrence obstructions
Membership in moment polytopes is in NP and coNP
The computational complexity of plethysm coefficients
Kronecker coefficients for some near-rectangular partitions
All-orders asymptotics of tensor model observables from symmetries of restricted partitions
Kronecker coefficients via symmetric functions and constant term identities
Mini-workshop: Kronecker, plethysm, and Sylow branching coefficients and their applications to complexity theory. Abstracts from the mini-workshop held February 23--29, 2020
On the Kronecker product of Schur functions of square shapes
All Kronecker coefficients are reduced Kronecker coefficients
On the representative ring of the symmetric group \(S_5\)
Vanishing of Littlewood-Richardson polynomials is in P
Estimating and computing Kronecker coefficients: a vector partition function approach
Breaking down the reduced Kronecker coefficients
On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
Algorithm for computing Kronecker basis
The Saxl conjecture for fourth powers via the semigroup property
Integrality, duality and finiteness in combinatoric topological strings
Kronecker products, characters, partitions, and the tensor square conjectures
Computation of dilated Kronecker coefficients

This page was built for publication: The complexity of computing Kronecker coefficients

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