The number of arcs in of a given cardinality
arXiv:2410.21818
Abstract
A subset of is called an arc if it does not contain three collinear points. We show that there are at most arcs of size , nearly matching a trivial lower bound . This was previously known to hold for , due to Bhowmick and Roche-Newton. The lower bound on is best possible up to a logarithmic factor.
3 pages