All Kronecker coefficients are reduced Kronecker coefficients

05/04/2023
by   Christian Ikenmeyer, et al.
0

We settle the question of where exactly the reduced Kronecker coefficients lie on the spectrum between the Littlewood-Richardson and Kronecker coefficients by showing that every Kronecker coefficient of the symmetric group is equal to a reduced Kronecker coefficient by an explicit construction. This implies the equivalence of a question by Stanley from 2000 and a question by Kirillov from 2004 about combinatorial interpretations of these two families of coefficients. Moreover, as a corollary, we deduce that deciding the positivity of reduced Kronecker coefficients is NP-hard, and computing them is #P-hard under parsimonious many-one reductions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/07/2023

Machine-Learning Kronecker Coefficients

The Kronecker coefficients are the decomposition multiplicities of the t...
research
02/22/2023

Quantum complexity of the Kronecker coefficients

Whether or not the Kronecker coefficients of the symmetric group count s...
research
02/03/2020

The Computational Complexity of Plethysm Coefficients

In two papers, Bürgisser and Ikenmeyer (STOC 2011, STOC 2013) used an ad...
research
12/19/2022

Reduced Order Model of a Generic Submarine for Maneuvering Near the Surface

A reduced order model of a generic submarine is presented. Computational...
research
02/19/2021

Training Neural Networks is ER-complete

Given a neural network, training data, and a threshold, it was known tha...
research
06/30/2023

Computational Complexity in Algebraic Combinatorics

Algebraic Combinatorics originated in Algebra and Representation Theory,...
research
05/29/2018

Properties of interaction networks, structure coefficients, and benefit-to-cost ratios

In structured populations the spatial arrangement of cooperators and def...

Please sign up or login with your details

Forgot password? Click here to reset