Finiteness conjecture for simple connected ordered matroids with prescribed broken-circuit topology
Let be positive integers. For an ordered matroid , write for its reduced broken circuit complex, and let denote its -st -number. Finiteness conjecture. The number of isomorphism classes of simple connected, rank ordered matroids satisfying
is finite. This is a finiteness assertion for ordered matroids whose reduced broken circuit complexes have prescribed topology; the supplied text does not indicate whether it has been proved or disproved.
References
Primary source
Federico Castillo and Jose Alejandro Samper, “Finiteness theorems for matroid complexes with prescribed topology”, arXiv:1809.00281 (2020).
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
No solutions have been posted yet.