A Sylvester-Gallai-type theorem for complex-representable matroids
Jim Geelen, Matthew E. Kroeker

TL;DR
This paper extends the Sylvester-Gallai theorem to complex-representable matroids, showing that high-rank such matroids contain specific flat structures, with improved bounds and a simpler proof compared to previous work.
Contribution
It provides a new, more elementary proof for the existence of specific flats in complex-representable matroids, improving bounds over prior results.
Findings
High-rank complex-representable matroids contain rank-k flats with exactly k points.
The bounds for the rank of matroids guaranteeing such flats are improved.
The proof is more elementary than previous approaches.
Abstract
The Sylvester-Gallai Theorem states that every rank- real-representable matroid has a two-point line. We prove that, for each , every complex-representable matroid with rank at least has a rank- flat with exactly points. For , this is a well-known result due to Kelly, which we use in our proof. A similar result was proved earlier by Barak, Dvir, Wigderson, and Yehudayoff and later refined by Dvir, Saraf, and Wigderson, but we get slightly better bounds with a more elementary proof.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Advanced Topology and Set Theory · Complexity and Algorithms in Graphs
