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

DOI10.1007/s00454-020-00201-3zbMath1451.14105arXiv1908.06390OpenAlexW3019897441MaRDI QIDQ2207602

Rom Pinchasi, Chaya Keller

Publication date: 23 October 2020

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

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

zbMATH Keywords

elliptic curvecubic curvepoint-line incidence

Mathematics Subject Classification ID

Elliptic curves (14H52) Configuration theorems in linear incidence geometry (51A20)

Related Items (1)

A note on the minimum number of red lines needed to pierce the intersections of blue lines

Cites Work

• Unnamed Item
• On sets defining few ordinary lines
• A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
• Few slopes without collinearity
• On linear combinatorics. III: Few directions and distorted lattices
• Some combinatorial problems in the plane
• 2N noncollinear points determine at least 2N directions
• A one-page solution of a problem of Erdős and Purdy
• On the sets of \(n\) points forming \(n+1\) directions
• Residues and the combinatorial Nullstellensatz
• There are not too many magic configurations
• Generalized Hyperfocused Arcs in PG(2,p)
• Research Problems in Discrete Geometry
• On the Sets of Directions Determined by n Points
• Sylvester's Problem on Collinear Points and a Relative

This page was built for publication: On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points