The computational complexity of plethysm coefficients

DOI10.1007/s00037-020-00198-4zbMath1506.68031arXiv2002.00788OpenAlexW3096428565MaRDI QIDQ2027205

Christian Ikenmeyer, Nick Fischer

Publication date: 25 May 2021

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.00788

zbMATH Keywords

computational complexityNP-hardnessgeometric complexity theoryplethysm coefficients

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of representation theory (05E10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Equations for GL invariant families of polynomials ⋮ Partial symmetries of iterated plethysms ⋮ Necessary conditions for the positivity of Littlewood-Richardson and plethystic coefficients

This page was built for publication: The computational complexity of plethysm coefficients