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

From MaRDI portal
Publication:4580087

DOI10.4230/LIPICS.SOCG.2017.15zbMATH Open1432.52011arXiv1611.08740OpenAlexW2558213327MaRDI QIDQ4580087FDOQ4580087


Authors: Abdul Basit, Zeev Dvir, Charles Wolf, Shubhangi Saraf Edit this on Wikidata


Publication date: 13 August 2018

Abstract: Kelly's theorem states that a set of n points affinely spanning mathbbC3 must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least 3n/2 ordinary lines, unless the configuration has n1 points in a plane and one point outside the plane (in which case there are at least n1 ordinary lines). In addition, when at most 2n/3 points are contained in any plane, we prove a theorem giving stronger bounds that take advantage of the existence of lines with 4 and more points (in the spirit of Melchior's and Hirzebruch's inequalities). Furthermore, when the points span 4 or more dimensions, with at most 2n/3 points contained in any three dimensional affine subspace, we show that there must be a quadratic number of ordinary lines.


Full work available at URL: https://arxiv.org/abs/1611.08740




Recommendations





Cited In (4)





This page was built for publication: On the number of ordinary lines determined by sets in complex space

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