A Sylvester-Gallai-type theorem for complex-representable matroids

DOI10.1007/S00454-024-00661-XMaRDI QIDQ6662774

Jim Geelen, Matthew E. Kroeker

Publication date: 14 January 2025

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

complex geometrymatroidsSylvester-Gallai theoremKelly's theorem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A resolution of the Sylvester-Gallai problem of J.-P. Serre
• Sylvester-Gallai theorems for complex numbers and quaternions
• A survey of Sylvester's problem and its generalizations
• Improved rank bounds for design matrices and a new proof of Kelly's theorem
• Oriented Matroids
• Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
• A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set.
• The Lines and Planes Connecting the Points of a Finite Set

This page was built for publication: A Sylvester-Gallai-type theorem for complex-representable matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6662774)