✦ LIBER ✦

New inductive constructions of complete caps in PG(N, q), q even

✍ Scribed by Alexander A. Davydov; Massimo Giulietti; Stefano Marcugini; Fernanda Pambianco

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 233 KB
Volume: 18
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20230

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Some new families of small complete caps in PG(N, q), q 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 article provide an improvement on the currently known upper bounds on the size of the smallest complete cap in PG(N, q), N≥4, for all q≥2^3^. In particular, substantial improvements are obtained for infinite values of q square, including q=2^2__Cm__^, C≥5, m≥3; for q=2^Cm^, C≥5, m≥9, with C, m odd; and for all q≤2^18^. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 177–201, 2010

📜 SIMILAR VOLUMES

Small complete caps in PG(N, q), q even

✍ Massimo Giulietti 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract A new family of small complete caps in __PG__(__N__,__q__), __q__ even, is constructed. Apart from small values of either __N__ or __q__, it provides an improvement on the currently known upper bounds on the size of the smallest complete cap in __PG__(__N__,__q__): for __N__ even, the l

One-factorizations of complete multigrap

One-factorizations of complete multigraphs and quadrics in PG(n,q)

✍ Gy. Kiss 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB

## Abstract A new infinite family of simple indecomposable one‐factorizations of the complete multigraphs is constructed by using quadrics of finite projective spaces. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 139–143, 2002; DOI 10.1002/jcd.997

Types of superregular matrices and the n

Types of superregular matrices and the number of n-arcs and complete n-arcs in PG (r, q)

✍ Gerzson Kéri 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB

## Abstract Based on the classification of superregular matrices, the numbers of non‐equivalent __n__‐arcs and complete __n__‐arcs in PG(__r__, __q__) are determined (i) for 4 ≤ __q__ ≤ 19, 2 ≤ __r__ ≤ q − 2 and arbitrary __n__, (ii) for 23 ≤ __q__ ≤ 32, __r__ = 2 and __n__ ≥ q − 8<$>. The equivale

Correction to: Types of superregular mat

Correction to: Types of superregular matrices and the number of n-arcs and complete n-arcs in PG(r, q)

✍ Gerzson Kéri 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 50 KB