Weak same-level reducibility conjecture for involutions
Statement
Let be even, let be an involution, and suppose that has level . A sign-change matrix is a matrix in , and is sign-change reducible if it is reducible by such a sign change. Weak same-level reducibility conjecture. If is sign-change reducible, then it is reducible by a sign-change matrix of level .
The preceding discussion explains that this is weaker than requiring all minimizers of the distance to have the same level as . It is intended to simplify the analysis of sign-change reducibility by restricting attention to sign changes of the same level; the source does not report a resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.