On sets of n points in general position that determine lines that can be pierced by n points

2019/08/18 by Keller, Chaya, Pinchasi, Rom
#05C10 #68R10 #Combinatorics (math.CO) #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.1908.06390

Abstract

Let P be a set of n points in general position in the plane. Let R be a set of n points disjoint from P such that for every x,y ∈ P the line through x and y contains a point in R outside of the segment delimited by x and y. We show that P ∪ R must be contained in a cubic curve.

Related

• On sets of points in general position that lie on a cubic curve in the plane and determine lines that can be pierced by few points
• On sets defining few ordinary lines
• Curves, points, incidences and covering
• Line partitions of internal points to a conic in PG(2,q)
• Sets of points which project to complete intersections