Minimal 1-saturating sets and complete caps in binary projective spaces.

A set \(S\subset\text{PG}(v, q)\) is \(1\)-saturating if any point of \(\text{PG}(v, q)\setminus S\) lies on a \(t\)-secant of \(S\) with \(t\geq 2\) if \(q\geq 3\) and \(t= 2\) if \(q= 2\). Caps in \(\text{PG}(v, q)\), \(v\geq 3\), are sets of points, no three of which are collinear. A cap \(S\subset\text{PG}(v, q)\) is complete if its bisecants cover all points of \(\text{PG}(v, q)\setminus S\). Complete caps are minimal \(1\)-saturating sets. In the present article for binary projective space \(\text{PG}(v, 2)\) the authors describe a number of constructions of minimal \(1\)-saturating sets including sets with inner lines and complete caps. The constructions give infinite families of sets with inner lines and complete caps in space with increasing dimension. Some constructions produce sets with an interesting symmetrical structure connected with inner lines, polygons, and orbits of stabilizer groups. Construction ``addition of space lift is convenient for both sets with inner lines and complete caps. The complete classification of minimal \(1\)-saturating sets in small geometries is obtained by computer and is connected with the constructions described. Some results of this work were represented without proofs in the previous article of the authors [see Proceedings of the IX International Workshop on Algebraic and Combin. Coding theory, ACCT-IX, Kranevo, Bulgaria, June 19--25, 113--119 (2004)].

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Minimal 1-saturating sets and complete caps in binary projective spaces.

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