Canonical form conjecture for binary Δ-matroids under handle slides
Statement
Let be a binary -matroid. A handle slide is the operation that replaces by for distinct elements of its ground set, as defined by the feasible-set transformation in the source. Let be the direct sum of with copies of , where is the direct sum of copies of , copies of , and copies of . For a binary -matroid, call it even when all feasible sets have the same parity of cardinality, and write for the difference between the sizes of a largest and a smallest feasible set.
Canonical form conjecture. For each binary -matroid , there is a sequence of handle slides taking to some where is the size of the ground set minus the size of a largest feasible set, is the size of a smallest feasible set, and is the difference in the sizes of a largest and a smallest feasible set. Moreover, if and only if is even, and if is odd then every value of from to can be attained.
This conjecture proposes a canonical classification of binary -matroids under handle slides, with the parameters constrained by the extremal feasible-set sizes and parity. The supplied text does not state whether the conjecture has been proved or disproved.
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.