📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

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

First Author: Ikenmeyer C

Attributed to: Algebraic complexity theory via the algebraic geometry and representation theory of generalised continued fractions funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1137/1.9781611977554.ch136

Publication URI: http://dx.doi.org/10.1137/1.9781611977554.ch136

Type: Book Chapter

Book Title: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2023)

Page Reference: 3573-3586