Computer search for small complete caps
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\).
- New upper bounds on the smallest size of a complete cap in the spaces \(\mathrm{PG}(3,q)\) and \(\mathrm{PG}(4,q)\).
- Complete caps in projective spaces PG\((n,q)\)
- New upper bounds on the smallest size of a complete cap in the space \(\mathrm{PG}(3,q)\)
- Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(3, q)\) and \(\mathrm{PG}(4, q)\)
- Large caps in small spaces
- An orderly algorithm and some applications in finite geometry
- scientific article; zbMATH DE number 3917102 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- scientific article; zbMATH DE number 2061794 (Why is no real title available?)
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- On the spectrum of the values \(k\) for which a complete \(k\)-cap in \(PG(n,q)\) exists
- Small complete caps in spaces of even characteristic
- The packing problem in statistics, coding theory and finite projective spaces
- On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\)
- On saturating sets in projective spaces.
- On saturating sets in small projective geometries
- New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane
- New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane
- Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture
- Small complete caps in three-dimensional Galois spaces
- The smallest size of a complete cap in PG(3,\,7)
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
- Complete caps in \(\mathrm{AG}(3, q)\) from elliptic curves
- Caps in \(\mathbb{Z}^2_n\)
- An efficient local search method for random 3-satisfiability
- New upper bounds on the smallest size of a complete cap in the space \(\mathrm{PG}(3,q)\)
- Recursive constructions of complete caps
- On sizes of complete arcs in \(PG(2,q)\)
- Small complete caps in Galois affine spaces
This page was built for publication: Computer search for small complete caps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1841870)
