Characterizing geometric designs, II

We provide a characterization of the classical point-line designs PG₁(n,q), where n?3, among all non-symmetric 2-(v,k,1)-designs as those with the maximal number of hyperplanes. As an application of this result, we characterize the classical quasi-symmetric designs PGn−2(n,q), where n?4, among all (not necessarily quasi-symmetric) designs with the same parameters as those having line size q+1 and all intersection numbers at least qn−4+?+q+1. Finally, we also give an explicit lower bound for the number of non-isomorphic designs having the same parameters as PG₁(n,q); in particular, we obtain a new proof for the known fact that this number grows exponentially for any fixed value of q.     

Some p‐ranks related to a conic in PG(2, q)

Let A be the incidence matrix of lines and points of the classical projective plane PG(2, q) with q odd. With respect to a conic in PG(2, q), the matrix A is partitioned into 9 submatrices. The rank of each of these submatrices over F_q, the defining field of PG(2, q), is determined. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 224–236, 2010     

On Maximal Partial Spreads in PG(n, q)

In this paper we construct maximal partial spreads in PG(3, q) which are a log q factor larger than the best known lower bound. For n ≥ 5 we also construct maximal partial spreads in PG(n, q) of each size between cnq ^{n ? 2} log q and c′ q ^{n ? 1}.     

On the code generated by the incidence matrix of points and hyperplanes in <Emphasis Type="Italic">PG</Emphasis>(<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">q</Emphasis>) and its dual

In this paper, we study the p-ary linear code C(PG(n,q)), q = p ^h , p prime, h ≥ 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n,q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n,q) and we exclude all possible codewords arising from small linear blocking sets. We also look at the dual code of C(PG(n,q)) and we prove that finding the minimum weight of the dual code can be reduced to finding the minimum weight of the dual code of points and lines in PG(2,q). We present an improved upper bound on this minimum weight and we show that we can drop the divisibility condition on the weight of the codewords in Sachar’s lower bound (Geom Dedicata 8:407–415, 1979). G. Van de Voorde’s research was supported by the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen).     

On the classification of semifield flocks

A classical lemma of Weil is used to characterise quadratic polynomials f with coefficients GF(qⁿ), q odd, with the property that f(x) is a non-zero square for all x∈GF(q). This characterisation is used to prove the main theorem which states that there are no subplanes of order q contained in the set of internal points of a conic in PG(2,qⁿ) for q?4n²−8n+2. As a corollary to this theorem it then follows that the only semifield flocks of the quadratic cone of PG(3,qⁿ) for those q exceeding this bound are the linear flocks and the Kantor-Knuth semifield flocks.     

The packing problem for projective geometries over GF(3) with dimension greater than five

An (n, d) set in the projective geometry PG(r, q) is a set of n points, no d of which are dependent. The packing problem is that of finding n(r, q, d), the largest size of an (n, d) set in PG(r, q). The packing problem for PG(r, 3) is considered. All of the values of n(r, 3, d) for r ? 5 are known. New results for r = 6 are n(6, 3, 5) = 14 and 20 ? n(6, 3, 4) ? 31. In general, upper bounds on n(r, q, d) are determined using a slightly improved sphere-packing bound, the linear programming approach of coding theory, and an orthogonal (n, d) set with the known extremal values of n(r, q, d)—values when r and d are close to each other. The BCH constructions and computer searches are used to give lower bounds. The current situation for the packing problem for PG(r, 3) with r ? 15 is summarized in a final table.     

Complete Spans on Hermitian Varieties

Let L be a general linear complex in PG(3, q) for any prime power q. We show that when GF(q) is extended to GF(q ²), the extended lines of L cover a non-singular Hermitian surface H ? H(3, q ²) of PG(3, q ²). We prove that if Sis any symplectic spread PG(3, q), then the extended lines of this spread form a complete (q ² + 1)-span of H. Several other examples of complete spans of H for small values of q are also discussed. Finally, we discuss extensions to higher dimensions, showing in particular that a similar construction produces complete (q ³ + 1)-spans of the Hermitian variety H(5, q ²).     

The number of designs with geometric parameters grows exponentially

It is well-known that the number of 2-designs with the parameters of a classical point-hyperplane design PG _n-1(n, q) grows exponentially. Here we extend this result to the number of 2-designs with the parameters of PG _d (n, q), where 2 ≤ d ≤ n ? 1. We also establish a characterization of the classical geometric designs in terms of hyperplanes and, in the special case d = 2, also in terms of lines. Finally, we shall discuss some interesting configurations of hyperplanes arising in designs with geometric parameters.     

Some New Maximal Sets of Mutually Orthogonal Latin Squares

Two ways of constructing maximal sets of mutually orthogonal Latin squares are presented. The first construction uses maximal partial spreads in PG(3, 4) \ PG(3, 2) with r lines, where r ∈ {6, 7}, to construct transversal-free translation nets of order 16 and degree r + 3 and hence maximal sets of r + 1 mutually orthogonal Latin squares of order 16. Thus sets of t MAXMOLS(16) are obtained for two previously open cases, namely for t = 7 and t = 8. The second one uses the (non)existence of spreads and ovoids of hyperbolic quadrics Q ⁺ (2m + 1, q), and yields infinite classes of q ^{2n ? 1} ? 1 MAXMOLS(q ²ⁿ ), for n ≥ 2 and q a power of two, and for n = 2 and q a power of three.     

Designs having the parameters of projective and affine spaces

Two constructions are described that yield an improved lower bound for the number of 2-designs with the parameters of PG _d (n, q), and a lower bound for the number of resolved 2-designs with the parameters of AG _d (n, q).     

A characterization of the Grassmann embedding of H(q), with q even

In this note, we characterize the Grassmann embedding of H(q), q even, as the unique full embedding of H(q) in PG(12, q) for which each ideal line of H(q) is contained in a plane. In particular, we show that no such embedding exists for H(q), with q odd. As a corollary, we can classify all full polarized embeddings of H(q) in PG(12, q) with the property that the lines through any point are contained in a solid; they necessarily are Grassmann embeddings of H(q), with q even.     

Linear Point Sets and Rédei Type k-blocking Sets in PG(n, q)

In this paper, k-blocking sets in PG(n, q), being of Rédei type, are investigated. A standard method to construct Rédei type k-blocking sets in PG(n, q) is to construct a cone having as base a Rédei type k-blocking set in a subspace of PG(n, q). But also other Rédei type k-blocking sets in PG(n, q), which are not cones, exist. We give in this article a condition on the parameters of a Rédei type k-blocking set of PG(n, q = p ^h ), p a prime power, which guarantees that the Rédei type k-blocking set is a cone. This condition is sharp. We also show that small Rédei type k-blocking sets are linear.     

Embedded Thick Finite Generalized Hexagons in Projective Space

We show that every embedded finite thick generalized hexagon of order (s, t) in PG(n,q) which satisfies the conditions

1. s = q
2. the set of all points of generates PG(n, q)
3. for anypoint x of , the set of all points collinear in withx is containedin a plane of PG(n, q)
4. for any point x of , the set of allpoints of not oppositex in is contained in a hyperplane ofPG,(n, q)

is necessarily the standard representation of H(q) in PG(6,q) (on the quadric Q(6, q)), the standard representation ofH(q) for q even in PG(5, q) (inside a symplectic space), orthe standard representation of H(q, ) in PG(7, q) (where the lines of are the lines fixed by a trialityon the quadric Q⁺(7, q)). This generalizes a result by Cameronand Kantor [3], which is used in our proof.     

On 1-Blocking Sets in PG(n,q), n ≥ 3

In this article we study minimal1-blocking sets in finite projective spaces _PG(n,q),n 3. We prove that in PG(n,q ²),q = p ^h , p prime, p > 3,h 1, the second smallest minimal 1-blockingsets are the second smallest minimal blocking sets, w.r.t.lines, in a plane of PG(n,q ²). We also study minimal1-blocking sets in PG(n,q ³), n 3, q = p ^h, p prime, p > 3,q 5, and prove that the minimal 1-blockingsets of cardinality at most q 3 + q ² + q + ¹ are eithera minimal blocking set in a plane or a subgeometry PG(3,q).     

Blocking Sets in PG(r, q n )

Let $\mathcal S$ be a Desarguesian (n – 1)-spread of a hyperplane Σ of PG(rn, q). Let Ω and ${\bar B}$ be, respectively, an (n – 2)-dimensional subspace of an element of $\mathcal S $ and a minimal blocking set of an ((r – 1)n + 1)-dimensional subspace of PG(rn, q) skew to Ω. Denote by K the cone with vertex Ω and base ${\bar B}$ , and consider the point set B defined by $$B=\left(K\setminus\Sigma\right)\cup \{X\in \mathcal S\, : \, X\cap K\neq \emptyset\}$$ in the Barlotti–Cofman representation of PG(r, q ⁿ ) in PG(rn, q) associated to the (n – 1)-spread $\mathcal S$ . Generalizing the constructions of Mazzocca and Polverino (J Algebraic Combin, 24(1):61–81, 2006), under suitable assumptions on ${\bar B}$ , we prove that B is a minimal blocking set in PG(r, q ⁿ ). In this way, we achieve new classes of minimal blocking sets and we find new sizes of minimal blocking sets in finite projective spaces of non-prime order. In particular, for q a power of 3, we exhibit examples of r-dimensional minimal blocking sets of size q ⁿ⁺² + 1 in PG(r, q ⁿ ), 3 ≤ r ≤ 6 and n ≥ 3, and of size q ⁴ + 1 in PG(r, q ²), 4 ≤ r ≤ 6; actually, in the second case, these blocking sets turn out to be the union of q ³ Baer sublines through a point. Moreover, for q an even power of 3, we construct examples of minimal blocking sets of PG(4, q) of size at least q ² + 2. From these constructions, we also get maximal partial ovoids of the hermitian variety H(4, q ²) of size q ⁴ + 1, for any q a power of 3.     

Sets of even type in PG(3, 4), alias the binary (85, 24) projective geometry code

To characterize Hermitian varieties in projective space PG(d, q) of d dimensions over the Galois field GF(q), it is necessary to find those subsets K for which there exists a fixed integer n satisfying (i) 3 ? n ? q ? 1, (ii) every line meets K in 1, n or q + 1 points. K is called singular or non-singular as there does or does not exist a point P for which every line through P meets K in 1 or q + 1 points. For q odd, a non-singular K is a non-singular Hermitian variety (M. Tallini Scafati “Caratterizzazione grafica delle forme hermitiane di un S_{r, q}” Rend. Mat. Appl.26 (1967), 273–303). For q even, q > 4 and d = 3, a non-singular K is a Hermitian surface or “looks like” the projection of a non-singular quadric in PG(4, q) (J.W.P. Hirschfeld and J.A. Thas “Sets of type (1, n, q + 1) in PG(d, q)” to appear). The case q = 4 is quite exceptional, since the complements of these sets K form a projective geometry code, a (21, 11) code for d = 2 and an (85, 24) code for d = 3. The full list of these sets is given.     

Bilinear flocks

A flock in PG(3, q) is a set of q planes which do not contain the vertex of a cone and have the property that the intersections of the planes of the flock with the cone partition the points of the cone except for the vertex. In this paper, we examine flocks, called bilinear flocks, where the planes of the flock pass through at least one of two distinct lines, called supporting lines in PG(3, q). We classify and provide examples of cones that admit bilinear flocks whose supporting lines intersect in PG(3, q). We also examine bilinear flocks whose supporting lines are skew, providing an example and also showing that this situation can not occur under certain conditions.     

Classes of optical orthogonal codes from arcs in root subspaces

We present new constructions for (n,w,λ) optical orthogonal codes (OOC) using techniques from finite projective geometry. In one case codewords correspond to (q-1)-arcs contained in Baer subspaces (and, in general, kth-root subspaces) of a projective space. In the other construction, we use sublines isomorphic to PG(2,q) lying in a projective plane isomorphic to PG(2,q^k), k>1. Our construction yields for each λ>1 an infinite family of OOCs which, in many cases, are asymptotically optimal with respect to the Johnson bound.     

On the intersection of two subgeometries of PG(n, q)

The study of the intersection of two Baer subgeometries of PG(n, q), q a square, started in Bose et al. (Utilitas Math 17, 65–77, 1980); Bruen (Arch Math 39(3), 285–288, (1982). Later, in Svéd (Baer subspaces in the n-dimensional projective space. Springer-Verlag) and Jagos et al. (Acta Sci Math 69(1–2), 419–429, 2003), the structure of the intersection of two Baer subgeometries of PG(n, q) has been completely determined. In this paper, generalizing the previous results, we determine all possible intersection configurations of any two subgeometries of PG(n, q).      

Some Characterizations of Finite Hermitian Veroneseans

We characterize the finite Veronesean of all Hermitian varieties of PG(n,q²) as the unique representation of PG(n,q²) in PG(d,q), d n(n+2), where points and lines of PG(n,q²) are represented by points and ovoids of solids, respectively, of PG(d,q), with the only condition that the point set of PG(d,q) corresponding to the point set of PG(n,q²) generates PG(d,q). Using this result for n=2, we show that is characterized by the following properties: (1) ; (2) each hyperplane of PG(8,q) meets in q²+1, q³+1 or q³+q²+1 points; (3) each solid of PG(8,q) having at least q+3 points in common with shares exactly q²+1 points with it.51E24