Unary-input hardness conjecture for Schubert structure constants

Determine whether computing Schubert structure constants remains #P-hard when the permutations and associated Schubert-problem data are encoded using unary inputs.

Background

The paper distinguishes between binary and unary encodings of Schubert problems. It reports that computing Littlewood–Richardson coefficients is #P-complete for binary inputs, while the complexity of computing arbitrary Schubert structure constants under unary encoding is presented as a conjectural extension of this hardness phenomenon. The question is relevant because unary inputs may be the preferred representation for arbitrary Schubert problems.