On the number of ordinary lines determined by sets in complex space

DOI10.1007/s00454-018-0039-4zbMath1415.52002OpenAlexW2898456353WikidataQ129050830 ScholiaQ129050830MaRDI QIDQ2415380

Abdul Basit, Shubhangi Saraf, Zeev Dvir, Charles Wolf

Publication date: 21 May 2019

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

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7188/

zbMATH Keywords

combinatorial geometrydesignsordinary linesSylvester-GallaiKelly's theorem

Mathematics Subject Classification ID

Helly-type theorems and geometric transversal theory (52A35)

Cites Work

• Unnamed Item
• On sets defining few ordinary lines
• A resolution of the Sylvester-Gallai problem of J.-P. Serre
• Scalings of matrices which have prespecified row sums and column sums via optimization
• There exist \(6n/13\) ordinary points
• The orbifold Langer-Miyaoka-Yau inequality and Hirzebruch-type inequalities
• 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
• On the Number of Ordinary Lines Determined by n Points
• Perturbed Identity Matrices Have High Rank: Proof and Applications
• On Double Diagonal and Cross Latin Squares
• Self-orthogonal latin squares of all orders 𝑛≠2,3,6
• LOGARITHMIC ORBIFOLD EULER NUMBERS OF SURFACES WITH APPLICATIONS
• Fractional Sylvester–Gallai theorems
• The Lines and Planes Connecting the Points of a Finite Set