Indexed metadata

The linearity Conjecture

Peter Sziklai

Source record

Source: arXiv

Published: Oct 21, 2026

arXiv: 2610.30503

Open original source ↗

Source abstract

The Linearity Conjecture states that in the projective plane PG(2,qq), q=phq=p^h, every minimal blocking set (w.r.t. lines) is a linear point set over some subfield of Fq{\mathbb F}_q. This paper contains the proof of the Linearity Conjecture for pe≠3,4p^e\ne 3,4, where ee is the exponent of the blocking set. The text contains 3 concatenated parts. In Part 0, we give a guide for reading Parts 1 and 2. Part 1 develops a great part of the method, and the case pe=2p^e=2 is solved. In Part 2 we prove the Linearity Conjecture for pe≥5p^e\geq 5.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.