The asymptotic abundance conjecture for sparse paving matroid stack delta-matroids
The asymptotic abundance conjecture for sparse paving matroid stack delta-matroids
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.
Sources & referencesView supporting material
Primary source
Joseph E Bonin, Carolyn Chun and Steven D Noble, “Delta-matroids as subsystems of sequences of Higgs lifts”, arXiv:1807.01375 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.