Even Sets and Dual Projective Geometric Codes: A Tale of Cylinders

Abstract

In this paper, we prove that the smallest even sets in $\mathrm{PG}(n,q)$, i.e. sets that intersect every line in an even number of points, are cylinders with a hyperoval as base. This fits into a more general study of dual projective geometric codes. Let $q$ be a prime power, and define ${\mathcal{C}}_k(n,q{)}^{\perp }$ as the kernel of the $k$-space vs. point incidence matrix of $\mathrm{PG}(n,q)$, seen as a matrix over the prime order subfield of ${\mathbb{F}}_q$. Determining the minimum weight of this linear code is still an open problem in general, but has been reduced to the case $k=1$. There is a known construction that constructs small weight codewords of ${\mathcal{C}}_1(n,q{)}^{\perp }$ from minimum weight codewords of ${\mathcal{C}}_1(2,q{)}^{\perp }$. We call such codewords cylinder codewords. We pose the conjecture that all minimum weight codewords of ${\mathcal{C}}_1(n,q{)}^{\perp }$ are cylinder codewords. This conjecture is known to be true if $q$ is prime. We take three steps towards proving that the conjecture is true in general: (1) We prove that the conjecture is true if $q$ is even. This is equivalent to our classification of the smallest even sets. (2) We prove that the minimum weight of ${\mathcal{C}}_1(n,q{)}^{\perp }$ is $q^{n-2}$ times the minimum weight of ${\mathcal{C}}_1(2,q{)}^{\perp }$, which matches the weight of cylinder codewords. Thus, we completely reduce the problem of determining the minimum weight of ${\mathcal{C}}_1(n,q{)}^{\perp }$ to the case $n=2$. (3) We prove that if the conjecture is true for $n=3$, it is true in general.

arXiv comment11 pages