Information values and attainment for proper residual odd ranks

Determine the worst-frequency information values and establish whether the corresponding optima are attained for all proper residual odd output ranks not covered by the exact even-rank and co-rank-one results.

Background

The paper solves the information-design problem for every even output rank and for the even-aperture co-rank-one case. It proves that regular globally identifying designs are dense for every rank at least three and that the globally identifying and unconstrained suprema coincide, but it explicitly does not establish exact attainment for unresolved proper odd ranks. The open issue therefore concerns both evaluating the arbitrary-row-space objective and determining whether a maximizing design exists in those remaining odd-rank cases.