An algorithm to count the number of caps in \mathbb{P}^3(\mathbb{F}_q)

MaRDI QIDQ6402865zbMATH OpenFDO

Authors Kelly Isham

Publication date 22 June 2022

Abstract: An $n$-cap in $k$-dimensional projective space is a set of $n$ points so that no three lie on a line. In this note, we provide an algorithm to count the number of $n$-caps in $mathbb{P}^3(mathbb{F}_q)$, which follows from our recent paper [9]. We then give exact formulas for the number of $n$-caps when $nle7$. The formulas are polynomial in $q$ when $nle6$ and quasipolynomial in $q$ when $n=7$.

This page was built for publication: An algorithm to count the number of caps in $\mathbb{P}^3(\mathbb{F}_q)$

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