41 is the largest size of a cap in \(PG(4, 4)\) (Q1299910): Difference between revisions

Let \(q\) be a power of a prime and \(k \geq 2\) be an integer. A \textit{cap} in \(PG(k,q)\) is a set of points no three of which are collinear. Denote by \(m_2(k,q)\) the maximal cardinality of a cap in \(PG(k,q)\). It is known that \(m_2(2,q) = q+1\) if \(q\) is odd and \(m_2(2,q) = q + 2\) if \(q\) is even. It is also known that \(m_2(3,q) = q^2 + 1\). Only two values \(m_2(k,q)\) were known for \(k > 3\): \textit{G. Pellegrino} proved that \(m_2(4,3) = 20\) [Matematiche 25, 149-157 (1971; Zbl 0223.50020)] and \textit{R. Hill} proved that \(m_2(5,3) = 56\) [Atti Accad. naz. Lincei, VIII. Ser., Rend., Cl. Sci. fis. Mat. natur. 54(1973), 378-384 (1974; Zbl 0342.05017)]. Using a computer program written in C++, the authors show that \(PG(4,4)\) does not contain a 42-cap. They also give explicitly two nonequivalent 41-caps proving that 41 is the largest size of a cap in \(PG(4,4)\).