The minimum order of complete caps in \(PG(4,4)\) (Q534515): Difference between revisions

A \textit{\(k\)-cap} \(K\) in PG\((n,q)\) is a set of \(k\) points, no three collinear. A \(k\)-cap \(K\) of PG\((n,q)\) is called \textit{complete} when it is not extendable to a \((k+1)\)-cap of PG\((n,q)\). The authors prove via computer searches that the smallest size for a complete \(k\)-cap in PG\((4,4)\) is equal to 20. It is known that 41 is the largest size for a \(k\)-cap in PG\((4,4)\). Furthermore, the authors prove that there exists a complete \(k\)-cap in PG\((4,4)\) for every integer \(k\), with \(20\leq k \leq 41\), by finding via their computer searches complete 21-caps in PG\((4,4)\).