Self-dual sets of type (m, n) in projective spaces

In this paper we introduce and analyze the notion of self-dual k-sets of type (m, n). We show that in a non-square order projective space such sets exist only if the dimension is odd. We prove that, in a projective space of odd dimension and order q, self-dual k-sets of type (m, n), with , are of elliptic and hyperbolic type, respectively. As a corollary we obtain a new characterization of the non-singular elliptic and hyperbolic quadrics.     

Complete caps in projective spaces PG (n, q)

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.     

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.     

Linear sets in finite projective spaces

In this paper linear sets of finite projective spaces are studied and the “dual” of a linear set is introduced. Also, some applications of the theory of linear sets are investigated: blocking sets in Desarguesian planes, maximum scattered linear sets, translation ovoids of the Cayley Hexagon, translation ovoids of orthogonal polar spaces and finite semifields. Besides “old” results, new ones are proven and some open questions are discussed.     

On the Action of the Groups GL(n+1, q), PGL(n + 1, q), SL(n + 1, q) and PSL(n + 1, q) on PG(n, q t)

Let q be a prime power and let n ≥ 0, t ≥ 1 be integers. We determine the sizes of the point orbits of each of the groups GL(n + 1, q), PGL(n + 1, q), SL(n + 1, q) and PSL(n + 1, q) acting on PG(n, q ^t) and for each of these sizes (and groups) we determine the exact number of point orbits of this size.     

On (q 2 + q + 1)-sets of class [1, m,n]2 in PG(3, q)

A characterization of cones in PG(3, q) as sets of points of PG(3, q) of size q ² + q + 1 projecting from a point V a set of q + 1 points of a plane of PG(3, q) and with three intersection numbers with respect to the planes is given.     

The polynomial degree of the Grassmannian G(1,n,q) of lines in finite projective space PG(n, q)

Let G: = G(1,n,q) denote the Grassmannian of lines in PG(n,q), embedded as a point-set in PG(N, q) with For n = 2 or 3 the characteristic function of the complement of G is contained in the linear code generated by characteristic functions of complements of n-flats in PG(N, q). In this paper we prove this to be true for all cases (n, q) with q = 2 and we conjecture this to be true for all remaining cases (n, q). We show that the exact polynomial degree of is for δ: = δ(n, q) = 0 or 1, and that the possibility δ = 1 is ruled out if the above conjecture is true. The result deg( for the binary cases (n,2) can be used to construct quantum codes by intersecting G with subspaces of dimension at least      

On n2 -sets of type (0,1,n) in projective planes

In this paper n²-sets of type (0,1,n), in projective planes of order greater than 3, are completely characterized.This paper was written while the author was studying at the University of Rome, under the direction of Prof. G. Tallini, supported by a grant from the Institute for Italian Hungarian Cultural Exchange.     

An algebraic characterization of sets of type (0,n)1 inAG(2,q)

In this paper we prove that inAG(2,q) a set of type (0,n)₁ exists if and only if an algebraic systemS admits solutions inGF(q ²).     

On regular {v,n}-arcs in finite projective spaces

A regular {v, n}-arc of a projective space P of order q is a set S of v points such that each line of P has exactly 0,1 or n points in common with S and such that there exists a line of P intersecting S in exactly n points. Our main results are as follows: (1) If P is a projective plane of order q and if S is a regular {v, n}-arc with n ≥ √q + 1, then S is a set of n collinear points, a Baer subplane, a unital, or a maximal arc. (2) If P is a projective space of order q and if S is a regular {v, n}-arc with n ≥ √q + 1 spanning a subspace U of dimension at least 3, then S is a Baer subspace of U, an affine space of order q in U, or S equals the point set Of U. © 1993 John Wiley & Sons, Inc.     

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

An infinite family of type (m,n) sets in PG(2,q2), q a square

A k-set of type (m,n), with k=(q+√q+1)(q²?q+1), m= 1+√q, n=q+√q+1, is proved to exist in a Galois plane PG(2,q²), q a square, and its construction is given. Thus, its complement, i.e. a ((q?√q)(q+√q+1)(q²?q+1); √q(q√q?√q?1),√q(q √q?1))-set, exists too. The special case q=16 is considered and the points of a (91;3,7)-set in PG(2,16) are exhibited. A generalization is given.     

Blocking sets and partial spreads in finite projective spaces

A t-blocking set in the finite projective space PG(d, q) with dt+1 is a set of points such that any (d–t)-dimensional subspace is incident with a point of and no t-dimensional subspace is contained in . It is shown that | |q ^t +...+1+q ^t–1q and the examples of minimal cardinality are characterized. Using this result it is possible to prove upper and lower bounds for the cardinality of partial t-spreads in PG(d, q). Finally, examples of blocking sets and maximal partial spreads are given.     

Some new results on sets of type (m,n) in projective planes

All possible sets of type (l,n) in a finite projective plane are completely characterized from the arithmetical point of view. Furthermore, necessary existence conditions are proved for sets of type (m,n) which are stronger then the previously known ones and provide the unique possible arithmetical solutions whenever they are satisfied.     

On parallelisms in finite projective spaces

Geometriae Dedicata -     

On t-covers in finite projective spaces

A t-cover of the finite projective space PG(d,q) is a setS of t-dimensional subspaces such that any point of PG(d,q) is contained in at least one element ofS. In Theorem 1 a lower bound for the cardinality of a t-coverS in PG(d,q) is obtained and in Theorem 2 it is shown that this bound is best possible for all positive integers t,d and for any prime-power q.     

On projective spaces PG(r, q) with r ≥ 4

In this paper a characterization of PG(r, q), r ≥ 4, in terms of planar spaces is given. Domenico Olanda: This research was carried out within the activity of INdAM-GNSAGA and supported by the Italian Ministry M.I.U.R.     

Characterization results on small blocking sets of the polar spaces Q +(2n + 1, 2) and Q +(2n + 1, 3)

In De Beule and Storme, Des Codes Cryptogr 39(3):323–333, De Beule and Storme characterized the smallest blocking sets of the hyperbolic quadrics Q ⁺(2n + 1, 3), n ≥ 4; they proved that these blocking sets are truncated cones over the unique ovoid of Q ⁺(7, 3). We continue this research by classifying all the minimal blocking sets of the hyperbolic quadrics Q ⁺(2n + 1, 3), n ≥ 3, of size at most 3 ⁿ + 3 ^n–2. This means that the three smallest minimal blocking sets of Q ⁺(2n + 1, 3), n ≥ 3, are now classified. We present similar results for q = 2 by classifying the minimal blocking sets of Q ⁺(2n + 1, 2), n ≥ 3, of size at most 2 ⁿ + 2 ^n-2. This means that the two smallest minimal blocking sets of Q ⁺(2n + 1, 2), n ≥ 3, are classified.