New inductive constructions of complete caps in $PG(N,q)$, $q$ even
Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda, Pambianco

TL;DR
This paper introduces new inductive methods to construct small complete caps in projective spaces over even finite fields, significantly improving upper bounds for their minimal sizes in higher dimensions.
Contribution
It presents novel inductive constructions for complete caps in PG(N,q) with q even, reducing the problem to the plane and improving known bounds for large q.
Findings
Improved upper bounds for smallest complete caps in PG(N,q) for q ≥ 2^3
Construction methods applicable to infinite q square values and specific q ranges
Enhanced bounds for dimensions N ≥ 4 and various q values
Abstract
Some new families of small complete caps in , even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem in the plane. The caps constructed in this paper provide an improvement on the currently known upper bounds on the size of the smallest complete cap in for all In particular, substantial improvements are obtained for infinite values of square, including for with odd; and for all
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
