The pseudo-hyperplanes and homogeneous pseudo-embeddings of the generalized quadrangles of order (3, t)

In the paper “as reported by De Bruyn (Adv Geom, to appear)”, we introduced the notions of pseudo-hyperplane and pseudo-embedding of a point-line geometry and proved that every generalized quadrangle of order (s, t), 2 ≤ s < ∞, has faithful pseudo-embeddings. The present paper focuses on generalized quadrangles of order (3, t). Using the computer algebra system GAP and invoking some theoretical relationships between pseudo-hyperplanes and pseudo-embeddings obtained in “De Bruyn (Adv Geom, to appear)”, we are able to give a complete classification of all pseudo-hyperplanes of ${\mathcal{Q}}$ . We hereby find several new examples of tight sets of generalized quadrangles, as well as a complete classification of all 2-ovoids of ${\mathcal{Q}}$ . We use the classification of the pseudo-hyperplanes of ${\mathcal{Q}}$ to obtain a list of all homogeneous pseudo-embeddings of ${\mathcal{Q}}$ .     

A common characterization of the projective spaces PG(4, n) and PG(5, n)

A common characterization of the projective spaces PG(4, n) and PG(5, n) in terms of finite irreducible planar spaces is given.     

Caps in the projective geometry PG(n,4)

We construct a cap C_n in PG(n,4) of size 12(2ⁿ⁻²−1)+5. In the cases when n=3 and 4, this yields geometric constructions of the well-known ovoid in PG(3,4) and the Tallini cap in PG(4,4).     

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

Subsets of PG(n,2) and Maximal Partial Spreads in PG(4,2)

Put θ _n = # {points in PG(n,2)} and φ _n = #{lines in PG(n,2)}. Let ψ be anypoint-subset of PG(n,2). It is shown thatthe sum of L = #{internal lines of ψ} and L′= #{external lines of ψ} is the same for all ψ having the same cardinality:[6pt] Theorem A If k is defined by k = |ψ| ? θ _{n ? 1}, then $$L + L' = \phi _{n - 1} + k(k - 1)/2.$$ (The generalization of this to subsets of PG(n,3) is also obtained.) Let $\mathcal{S}$ be a partial spreadof lines in PG(4,2) and let N denote the number of reguli contained in $\mathcal{S}$ .Use of Theorem A gives rise to a simple proof of:[6pt] Theorem B If $\mathcal{S}$ is maximal then one of the followingholds: (i) $\left| \mathcal{S} \right| = 5,{\text{ }}N = 10;{\text{ }}$ (ii) $\left| \mathcal{S} \right| = 7,{\text{ }}N = 4;{\text{ }}$ (iii) $\left| \mathcal{S} \right| = 9,{\text{ }}N = 4.$ If (i) holds then $\mathcal{S}$ is spread in a hyperplane.It is shown that possibility (ii) is realized by precisely threeprojectively distinct types of partial spread. Explicit examplesare also given of four projectively distinct types of partialspreads which realize possibility (iii). For one of these types,type X, the four reguli have a common line. It isshown that those partial spreads in PG(4,2) of size 9 which arise, by a simple construction, from a spreadin PG(5,2), are all of type X.     

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.     

The Largest Cap in AG(4, 4) and Its Uniqueness

We show that 40 is the maximum number of points of a cap in AG(4, 4). Up to semi-linear transformations there is only one such 40-cap. Its group of automorphisms is a semidirect product of an elementary abelian group of order 16 and the alternating group A ₅.     

A characterisation of the embeddings of PG(m,q) into PG(n,qr).

Let S_m be an embedding of PG(m,q) into PG(n,q^r),with n < m, such that S_m generates PG(n,q^r). S_m can be obtained as a projection from a (m–n–1)-dimensional subspace V_m–n–1 into a non incident n-dimensional subspace V_n of some strong embedding S of PG(m,q) into PG(m,q^r).     

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}.     

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.     

Classification of the (n, 3)-arcs in PG(2, 7)

In this paper the classification of the (n, 3)-arcs in PG(2, 7) is presented. It has been obtained using a computer-based exhaustive search that exploits projective equivalence and produces exactly one representative of each equivalence class. For each (n, 3)-arc, the automorphism group and the maximal size of a contained k-arc have been found.     

n维有限射影几何上(d,r)-析取矩阵的性质及其界

介绍了n维有限射影几何上子空间的性质,利用这些性质研究了非适应性群测模型(d,r)-析取矩阵,然后计算了(d,r)-析取矩阵的相关参数,给出了它的行界.     

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 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).      

Embedding 1-Factorizations of K n in PG(2, 32)

1-Factorizations of the complete graph K _n embedded in a finite Desarguesian projective plane PG(2, q), q even, are hyperfocused arcs of size n. The classification of hyperfocused arcs is motivated by applications to 2-level secret sharing schemes. So far it has been done for q  ≤ 16, and for special types of hyperfocused arcs. In this paper the case q = 32 is investigated and the following two results are proven. (i) Uniqueness of hyperfocused 12-arcs, up to projectivities. (ii) Non-existence of hyperfocused 14-arcs.