Skip to main content
SpringerLink
Log in

Complete caps in projective spaces PG (n, q)

  • OriginalPaper
  • Published:
Journal of Geometry Aims and scope Submit manuscript

Abstract.

A computer search in the finite projective spaces PG(n, q) for the spectrum of possible sizes k of complete k-caps is done. Randomized greedy algorithms are applied. New upper bounds on the smallest size of a complete cap are given for many values of n and q. Many new sizes of complete caps are obtained.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute for Information Transmission Problems , Russian Academy of Science , 101447, Moscow, Russia

    Alexander A. Davydov

  2. Dipartimento di Matematica, Università degli Studi di Perugia, 06123, Perugia, Italy

    Stefano Marcugini & Fernanda Pambianco

Authors
  1. Alexander A. Davydov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Marcugini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fernanda Pambianco
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Alexander A. Davydov, Stefano Marcugini or Fernanda Pambianco.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Davydov, A.A., Marcugini, S. & Pambianco, F. Complete caps in projective spaces PG (n, q). J. Geom. 80, 23–30 (2004). https://doi.org/10.1007/s00022-004-1778-3

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00022-004-1778-3

Mathematics Subject Classification (2000):

Keywords:

Search

Navigation