The asymptotic abundance conjecture for sparse paving matroid stack delta-matroids
Statement
A matroid stack delta-matroid is a delta-matroid whose proper set systems in its stack are matroids. It is sparse paving when every matroid in its stack is sparse paving, meaning that the matroid and its dual are paving. The asymptotic abundance conjecture for sparse paving matroid stack delta-matroids. Almost all matroid stack delta-matroids are sparse paving, asymptotically.
This is proposed as a conjectural analogue of the asymptotic abundance conjecture for sparse paving matroids. The source provides no resolution, so the conjecture remains open.
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.