Abstract
AbstractPlanar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao (Discret Comput Geom 50(2):409–468, 2013) have shown that the maximum possible number of triple lines for an n-element set is $$\lfloor n\hspace{0.33325pt}(n - 3)/6\rfloor + 1$$
⌊
n
(
n
-
3
)
/
6
⌋
+
1
. Here we address the related problem of describing the structure of the asymptotically near-optimal configurations, i.e., of those for which the number of straight lines which go through three or more points has a quadratic (i.e., best possible) order of magnitude. We pose the problem whether such point sets must always be related to cubic curves. To support this conjecture we settle various special cases; some of them are also related to the four-in-a-line problem of Erdős.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference12 articles.
1. Elekes, G.: On linear combinatorics. III. Few directions and distorted lattices. Combinatorica 19(1), 43–53 (1999)
2. Elekes, G., Király, Z.: On the combinatorics of projective mappings. J. Algebraic Comb. 14(3), 183–197 (2001)
3. Elekes, G., Rónyai, L.: A combinatorial problem on polynomials and rational functions. J. Comb. Theory Ser. A 89(1), 1–20 (2000)
4. Elekes, G., Szabó, E.: How to find groups? (and how to use them in Erdős geometry?). Combinatorica 32(5), 537–571 (2012)
5. Erdős, P., Purdy, G.: Some extremal problems in geometry IV. In: 7th Southeastern Conference Combinatorics, Graph Theory, and Computing (Baton Rouge 1976). Congressus Numerantium, vol. 17, pp. 307–322. Utilitas Mathematica, Winnipeg (1976)