On sizes of complete caps in projective spaces PG(n, q) and arcs in planes PG(2, q)

More than thirty new upper bounds on the smallest size t ₂(2, q) of a complete arc in the plane PG(2, q) are obtained for (169 ≤ q ≤ 839. New upper bounds on the smallest size t ₂(n, q) of the complete cap in the space PG(n, q) are given for n = 3 and 25 ≤ q ≤ 97, q odd; n = 4 and q = 7, 8, 11, 13, 17; n = 5 and q = 5, 7, 8, 9; n = 6 and q = 4, 8. The bounds are obtained by computer search for new small complete arcs and caps. New upper bounds on the largest size m ₂(n, q) of a complete cap in PG(n, q) are given for q = 4, n = 5, 6, and q = 3, n = 7, 8, 9. The new lower bound 534 ≤ m ₂(8, 3) is obtained by finding a complete 534-cap in PG(8, 3). Many new sizes of complete arcs and caps are obtained. The updated tables of upper bounds for t ₂(n, q), n ≥ 2, and of the spectrum of known sizes for complete caps are given. Interesting complete caps in PG(3, q) of large size are described. A proof of the construction of complete caps in PG(3, 2 ^h ) announced in previous papers is given; this is modified from a construction of Segre. In PG(2, q), for q = 17, δ = 4, and q = 19, 27, δ = 3, we give complete ${(\frac{1}{2}(q + 3) + \delta)}$ -arcs other than conics that share ${\frac{1}{2}(q + 3)}$ points with an irreducible conic. It is shown that they are unique up to collineation. In PG(2, q), ${{q \equiv 2}}$ (mod 3) odd, we propose new constructions of ${\frac{1}{2} (q + 7)}$ -arcs and show that they are complete for q ≤ 3701.     

On regular semiovals in PG(2,q)

In this paper we prove that a point set in PG(2,q) meeting every line in 0, 1 or r points and having a unique tangent at each of its points is either an oval or a unital. This answers a question of Blokhuis and Szőnyi [1]. Research was partially supported by OTKA Grants T 043758, F 043772; the preparation of the final version was supported by OTKA Grant T 049662 and TéT grant E-16/04.     

Infinite family of large complete arcs in PG(2, q n ), with q odd and n > 1 odd

For q odd and n > 1 odd, a new infinite family of large complete arcs K′ in PG(2, q ⁿ ) is constructed from complete arcs K in PG(2, q) which have the following property with respect to an irreducible conic ${\mathcal{C}}$ in PG(2, q): all the points of K not in ${\mathcal{C}}$ are all internal or all external points to ${\mathcal{C}}$ according as q ≡ 1 (mod 4) or q ≡ 3 (mod 4).     

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

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 equivalence classes over both PGL (k, q) and PΓL(k, q) are considered throughout the examinations and computations. For the classification, an n‐arc is represented by the systematic generator matrix of the corresponding MDS code, without the identity matrix part of it. A rectangular matrix like this is superregular, i.e., it has only non‐singular square submatrices. Four types of superregular matrices are studied and the non‐equivalent superregular matrices of different types are stored in databases. Some particular results on t(r, q) and m′(r, q)—the smallest and the second largest size for complete arcs in PG(r, q)—are also reported, stating that m′(2, 31) = 22, m′(2, 32) = 24, t(3, 23) = 10, and m′(3, 23) = 16. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 363–390, 2006     

On (q 2 + q + 2, q + 2)-arcs in the Projective Plane PG(2, q)

A (k,n)-arc in PG(2,q) is usually defined to be a set of k points in the plane such that some line meets in n points but such that no line meets in more than n points. There is an extensive literature on the topic of (k,n)-arcs. Here we keep the same definition but allow to be a multiset, that is, permit to contain multiple points. The case k=q ²+q+2 is of interest because it is the first value of k for which a (k,n)-arc must be a multiset. The problem of classifying (q ²+q+2,q+2)-arcs is of importance in coding theory, since it is equivalent to classifying 3-dimensional q-ary error-correcting codes of length q ²+q+2 and minimum distance q ². Indeed, it was the coding theory problem which provided the initial motivation for our study. It turns out that such arcs are surprisingly rich in geometric structure. Here we construct several families of (q ²+q+2,q+2)-arcs as well as obtain some bounds and non-existence results. A complete classification of such arcs seems to be a difficult problem.     

Blocking sets in PG(2, q n ) from cones of PG(2n, q)

Let Ω and be a subset of Σ = PG(2n−1,q) and a subset of PG(2n,q) respectively, with Σ ⊂ PG(2n,q) and . Denote by K the cone of vertex Ω and base and consider the point set B defined by

The automorphism group of a complete (q − 1)-arc in PG(2,q)

The automorphism group of the set of 12 points associated with an apolar system of conics is determined. A complete (q ? 1)-arc for q = 13 can be obtained as a special case. The orbits of its automorphism group are also described. © 1994 John Wiley & Sons, Inc.     

On Buekenhout-Metz unitals in PG(2,q 2),q even

Research partially supported by M.P.I. (Research project Strutture geometriche combinatorie e loro applicazioni).     

On large minimal blocking sets in PG(2,q)

The size of large minimal blocking sets is bounded by the Bruen–Thas upper bound. The bound is sharp when q is a square. Here the bound is improved if q is a non‐square. On the other hand, we present some constructions of reasonably large minimal blocking sets in planes of non‐prime order. The construction can be regarded as a generalization of Buekenhout's construction of unitals. For example, if q is a cube, then our construction gives minimal blocking sets of size q^4/3 + 1 or q^4/3 + 2. Density results for the spectrum of minimal blocking sets in Galois planes of non‐prime order is also presented. The most attractive case is when q is a square, where we show that there is a minimal blocking set for any size from the interval . © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 25–41, 2005.     

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

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 leading term is replaced by with , for N odd the leading term is replaced by with . © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 420–436, 2007     

Cyclic Arcs in PG(2, q)

B.C. Kestenband [9], J.C. Fisher, J.W.P. Hirschfeld, and J.A. Thas [3], E. Boros, and T. Szönyi [1] constructed complete (q ² ? q + l)-arcs in PG(2, q ²), q ≥ 3. One of the interesting properties of these arcs is the fact that they are fixed by a cyclic protective group of order q ² ? q + 1. We investigate the following problem: What are the complete k-arcs in PG(2, q) which are fixed by a cyclic projective group of order k? This article shows that there are essentially three types of those arcs, one of which is the conic in PG(2, q), q odd. For the other two types, concrete examples are given which shows that these types also occur.     

Small semiovals in PG(2, q)

A semioval in a projective plane is a nonempty subset S of points with the property that for every point P ∈ S there exists a unique line ℓ such that . It is known that and both bounds are sharp. We say that S is a small semioval in if . Dover [5] proved that if S has a (q − 1)-secant, then , thus S is small, and if S has more than one (q − 1)-secant, then S can be obtained from a vertexless triangle by removing some subset of points from one side. We generalize this result and prove that if there exist integers 1 ≤ t and − 1 ≤ k such that and S has a (q − t)-secant, then the tangent lines at the points of the (q − t)-secant are concurrent. Specially when t = 1 then S can be obtained from a vertexless triangle by removing some subset of points from one side. The research was supported by the Italian-Hungarian Intergovernmental Scientific and Technological Cooperation Project, Grant No. I-66/99 and by the Hungarian National Foundation for Scientific Research, Grant Nos. T 043556 and T 043758.     

On the cardinality of blocking sets in PG(2,q)

Denote by PG(2,q) the finite desarguesian projective plane of order q, where q=p^h, p a prime, q>2. We define the function m(q) as follows: m(q)=q, if q is a square; m(q)=(q+1)/2, if q is a prime; m(q)=p^h–d, if q=p^h with h an odd integer, where d denotes the greatest divisor of h different from h. The following theorem is proved: For any integer k with q+m(q)+1 k q²–m(q), there exists a blocking set in PG(2,q) having exactly k elements.To Professor Adriano Barlotti on his 60th birthday.Research partially supported by G.N.S.A.G.A. (CNR)     

New lower bounds on the size of (n,r)‐arcs in PG(2,q)

An $\left(n,r\right)$‐arc in $\text{PG}\left(2,q\right)$ is a set of $n$ points such that each line contains at most $r$ of the selected points. It is well known that $\left(n,r\right)$‐arcs in $\text{PG}\left(2,q\right)$ correspond to projective linear codes. Let $m_r\left(2,q\right)$ denote the maximal number $n$ of points for which an $\left(n,r\right)$‐arc in $\text{PG}\left(2,q\right)$ exists. In this paper we obtain improved lower bounds on $m_r\left(2,q\right)$ by explicitly constructing $\left(n,r\right)$‐arcs. Some of the constructed $\left(n,r\right)$‐arcs correspond to linear codes meeting the Griesmer bound. All results are obtained by integer linear programming.