Positivity of the symmetric group characters is as hard as the polynomial time hierarchy

DOI10.1093/IMRN/RNAD273MaRDI QIDQ6624316zbMATH OpenFDO

Authors Christian Ikenmeyer, Igor Pak, Greta Panova

Publication date 25 October 2024

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/IMRN/RNAD273

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cited in

(4)

• Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy
• Positivity of Schubert coefficients
• Vanishing of Schubert coefficients via the effective Hilbert nullstellensatz
• Signed combinatorial interpretations in algebraic combinatorics

This page was built for publication: Positivity of the symmetric group characters is as hard as the polynomial time hierarchy

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