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

DOI10.1093/IMRN/RNAD273MaRDI QIDQ6624316

Christian Ikenmeyer, Greta Panova, Igor Pak

Publication date: 25 October 2024

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

Mathematics Subject Classification ID

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

Related Items (1)

Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy

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)