Reduced-pair conjecture for nonintegral type-2 zero-problems
Statement
Let be a 3M-DAP, define and , and set
A -pair is a maximal inseparable -pair with and .
Reduced-pair conjecture. If and is not an integer, then there exists an optimal solution in which all maximal inseparable pairs are either -pairs or -pairs.
This conjecture predicts a two-size structure for maximal inseparable pairs in the nonintegral case. The source gives no resolution in the supplied context.
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.