Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

New Upper Bounds on the Sizes of Caps in \(PG(N,5)\) and \(PG(N,7)\)

Y. Edel1, L. Storme2, P. Sziklait3
1University of Heidelberg, Mathematisches Institut der Univer- sitdt, Im Neuenheimer Feld 288, 69120 Heidelberg, Germany
2Ghent University, Dept. of Pure Maths and Computer Al- gebra, Krijgslaan 281, 9000 Gent, Belgium
3Eétvés University, Budapest, Pézmdny P. sétdény 1/c, Bu- dapest, Hungary H-1117
  • Published: 28/02/2007

Abstract

Let \( m_2(N, q) \) denote the size of the largest caps in \( PG(N, q) \) and let \( m_2′(N, q) \) denote the size of the second-largest complete caps in \( PG(N, q) \). Presently, it is known that \( m_2(4, 5) \leq 111 \) and that \( m_2(4, 7) \leq 316 \). Via computer searches for caps in \( PG(4, 5) \) using the result of Abatangelo, Larato, and Korchmáros that \( m_2′(3, 5) = 20 \), we improve the first upper bound to \( m_2(4, 5) \leq 88 \). Computer searches in \( PG(3, 7) \) show that \( m_2′(3, 7) = 32 \), and this latter result then improves the upper bound on \( m_2(4, 7) \) to \( m_2(4, 7) \leq 238 \). We also present the known upper bounds on \( m_2(N, 5) \) and \( m_2(N, 7) \) for \( N > 4 \).

Citation
Y. Edel, L. Storme, P. Sziklait. New Upper Bounds on the Sizes of Caps in \(PG(N,5)\) and \(PG(N,7)\)[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 060. 7-32. .