A Sylvester-Gallai-type theorem for complex-representable matroids
Combinatorics
2024-04-30 v2
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.
Keywords
Cite
@article{arxiv.2212.03307,
title = {A Sylvester-Gallai-type theorem for complex-representable matroids},
author = {Jim Geelen and Matthew E. Kroeker},
journal= {arXiv preprint arXiv:2212.03307},
year = {2024}
}