Connectivity conjecture for maximal weakly separated collections
Statement
Let be the set of maximal collections of pairwise weakly separated -subsets of , and let a -move replace one of the two indicated members of a maximal collection by the other while preserving weak separability and maximality. Connectivity conjecture. For any collections , there is a sequence of -moves transforming into . The source states this as a conjecture after proving that individual -moves preserve weak separability and maximality; no general proof is supplied.
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.