ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MM be a representable matroid with set of circuits C\mathcal{C}. For matroids on a fixed ground set, use the weak order defined by M1≥M2M_1\geq M_2 when every dependent set of M1M_1 is dependent in M2M_2. Categorical genericity conjecture. Then

δM≥δOW(R)\delta M\geq\delta_{OW}(R)

for every representation RR of MM, where the order is the weak order on matroids with ground set C\mathcal{C}. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.