2023/11/28 by Andrei Staicu, Staicu, Andrei
Computer Science · Mathematics · #Advanced Graph Theory Research #Algebraic Geometry (math.AG) #Coding theory and cryptography #FOS: Mathematics #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2311.16578
openalex publication_date 2023/11/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Given a collection of points in the plane, classifying which subsets are collinear is a natural problem and is related to classical geometric constructions. We consider collections of points in a projective plane over a finite field such that no three are collinear. This is a finite set and its size is both combinatorially interesting and has deeper topological consequences. We count the number of such collections classified by the algebraic symmetries of the finite field. Variations of this problem have been considered by Glynn, Bergvall, Das, O'Connor et al. We obtain the counts for 7 points over fields of characteristic 2. These new counts are governed by the existence and classification of a configuration of points called the Fano plane.