Most plane curves over finite fields are not blocking

From MaRDI portal



Abstract: A plane curve CsubsetmathbbP2 of degree d is called emph{blocking} if every mathbbFq-line in the plane meets C at some mathbbFq-point. We prove that the proportion of blocking curves is o(1) when dgeq2q−1 and qoinfty. We also show that the same conclusion holds for smooth curves under the somewhat weaker condition dgeq3p and d,qoinfty. Moreover, the two events in which a random plane curve is smooth and is blocking, respectively, are shown to be asymptotically independent. Extending a classical result on the number of mathbbFq-roots of random polynomials, we find that the limiting distribution of the number of mathbbFq-points in the intersection of a random plane curve and a fixed mathbbFq-line is Poisson with mean 1. We also present an explicit formula for the proportion of blocking curves involving statistics on the number of mathbbFq-points contained in a union of k lines for k=1,2,ldots,q2+q+1.






Describes a project that uses

Uses Software






This page was built for publication: Most plane curves over finite fields are not blocking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201503)