{"paper":{"title":"A probabilistic construction of small complete caps in projective spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniele Bartoli, Fernanda Pambianco, Stefano Marcugini","submitted_at":"2014-06-03T09:52:37Z","abstract_excerpt":"In this work complete caps in $PG(N,q)$ of size $O(q^{\\frac{N-1}{2}}\\log^{300} q)$ are obtained by probabilistic methods. This gives an upper bound asymptotically very close to the trivial lower bound $\\sqrt{2}q^{\\frac{N-1}{2}}$ and it improves the best known bound in the literature for small complete caps in projective spaces of any dimension. The result obtained in the paper also gives a new upper bound for $l(m,2,q)_4$, that is the minimal length $n$ for which there exists an $[n,n-m, 4]_q2$ covering code with given $m$ and $q$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5060","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}