Categorical genericity conjecture for the combinatorial derived matroid
Statement
Let be a representable matroid with set of circuits . For matroids on a fixed ground set, use the weak order defined by when every dependent set of is dependent in . Categorical genericity conjecture. Then
for every representation of , where the order is the weak order on matroids with ground set . This claims that the combinatorial derived matroid is the generic, maximal derived matroid in the categorical weak-order sense.
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.