{"title":"A Sylvester–Gallai-Type Theorem for Complex-Representable Matroids","authors":"Jim Geelen, Matthew E. Kroeker","doi":"10.1007/s00454-024-00661-x","DOIUrl":null,"url":null,"abstract":"<p>The Sylvester–Gallai Theorem states that every rank-3 real-representable matroid has a two-point line. We prove that, for each <span>\\(k\\ge 2\\)</span>, every complex-representable matroid with rank at least <span>\\(4^{k-1}\\)</span> has a rank-<i>k</i> flat with exactly <i>k</i> points. For <span>\\(k=2\\)</span>, 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.</p>","PeriodicalId":50574,"journal":{"name":"Discrete & Computational Geometry","volume":"93 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete & Computational Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00454-024-00661-x","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
The Sylvester–Gallai Theorem states that every rank-3 real-representable matroid has a two-point line. We prove that, for each \(k\ge 2\), every complex-representable matroid with rank at least \(4^{k-1}\) has a rank-k flat with exactly k points. For \(k=2\), 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.
期刊介绍:
Discrete & Computational Geometry (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role. It publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometric graphs, geometry of numbers, and motion planning.