Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings
share
We consider the problem of outputting succinct encodings of lists of generators for invariant rings. Mulmuley conjectured that there are always polynomial sized such encodings for all invariant rings. We provide simple examples that disprove this conjecture (under standard complexity assumptions).
READ FULL TEXT