English

Most plane curves over finite fields are not blocking

Algebraic Geometry 2024-02-20 v2 Combinatorics Number Theory

Abstract

A plane curve CP2C\subset\mathbb{P}^2 of degree dd is called \emph{blocking} if every Fq\mathbb{F}_q-line in the plane meets CC at some Fq\mathbb{F}_q-point. We prove that the proportion of blocking curves among those of degree dd is o(1)o(1) when d2q1d\geq 2q-1 and qq \to \infty. We also show that the same conclusion holds for smooth curves under the somewhat weaker condition d3pd\geq 3p and d,qd, q \to \infty. Moreover, the two events in which a random plane curve is smooth and respectively blocking are shown to be asymptotically independent. Extending a classical result on the number of Fq\mathbb{F}_q-roots of random polynomials, we find that the limiting distribution of the number of Fq\mathbb{F}_q-points in the intersection of a random plane curve and a fixed Fq\mathbb{F}_q-line is Poisson with mean 11. We also present an explicit formula for the proportion of blocking curves involving statistics on the number of Fq\mathbb{F}_q-points contained in a union of kk lines for k=1,2,,q2+q+1k=1, 2, \ldots, q^2+q+1.

Keywords

Cite

@article{arxiv.2211.08523,
  title  = {Most plane curves over finite fields are not blocking},
  author = {Shamil Asgarli and Dragos Ghioca and Chi Hoi Yip},
  journal= {arXiv preprint arXiv:2211.08523},
  year   = {2024}
}

Comments

21 pages, revised based on referee comments

R2 v1 2026-06-28T05:59:34.336Z