Reduced-pair conjecture for nonintegral type-2 zero-problems
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.
References
Primary source
Richard E. Chatwin, “An Optimal Solution for the Muffin Problem”, arXiv:1907.08726 (2020).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.