Beck's theorem for plane curves (Q2223446)

A theorem of \textit{J. Beck} [Combinatorica 3, 281--297 (1983; Zbl 0533.52004)] provides an asymptotic estimate for the number of lines determined by a set \(A \subset \mathbb{R}^2\), provided not too many points of \(A\) are collinear. In this article, the author generalizes Beck's result to curves of arbitrary degree \(d\) and to sets \(A \subset \mathbb{K}^2\), with \(\mathbb{K}\) being an arbitrary field of characteristic zero, with the property that not too many points of \(A\) lie an algebraic curve of degree \(d\) or less. The proof translates the counting of algebraic curves of degree at most \(d\) in \(\mathbb{K}^2\) to the counting of hyperplanes in \(\mathbb{K}^{\frac{d(d+3)}{2}}\) via the Veronese map, uses a result by \textit{B. Lund} [Combinatorica 38, No. 5, 1149--1174 (2018; Zbl 1438.52035)] to estimate the number of hyperplanes in case of \(\mathbb{K} = \mathbb{C}\) and uses ideas of related to the Lefschetz principle to transfer results to fields of characteristic zero.