Computer search for small complete caps (Q1841870)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computer search for small complete caps
scientific article

    Statements

    Computer search for small complete caps (English)
    0 references
    27 September 2001
    0 references
    A cap \(K\) in a projective space PG\((d,q)\) of dimension \(d\) over the finite field GF\((q)\) is a set of points no three of which are collinear. A cap \(K\) is complete if any point outside \(K\) is a bisecant of \(K\). Let \(n_2(d,q)\) be the minimum number of points of a complete cap in PG\((d,q)\). By applying a stochastic local computer search, called record-to-record travel, the author is able to find 14 new complete caps, resulting in new upper bounds for \(n_2(d,q)\), namely \(n_2(3,7) \leq 17\), \(n_2(3,8) \leq 20\), \(n_2(3,9) \leq 24\), \(n_2(3,11) \leq 30\), \(n_2(3,13) \leq 37\), \(n_2(3,17) \leq 52\), \(n_2(4,5) \leq 31\), \(n_2(4,7) \leq 57\), \(n_2(4,8) \leq 72\), \(n_2(4,9) \leq 88\), \(n_2(5,4) \leq 50\), and \(n_2(5,5) \leq 83\).
    0 references
    projective plane
    0 references
    complete cap
    0 references

    Identifiers