Geertrui Van de Voorde

We describe a new construction of a subset of $${\mathbb {P}}^4$$ P 4 with no four points on a plane over any finite field of order q in which 3 is not a square. This set has size $$2q+1$$ 2 q + 1 , is maximal with respect to inclusion, and is the largest known such set.

In this paper, we solve a classical counting problem for non-degenerate quadratic forms defined on a vector space in odd characteristic: given a subspace \(\pi\), we determine the number of non-singular subspaces that are trivially intersecting with \(\pi\) and span a nonsingular subspace with \(\pi\). Lower bounds for the quantity of such pairs where \(\pi\) is nonsingular were first studied in [S. P. Glasby, Alice C. Niemeyer, and Cheryl E. Praeger. The probability of spanning a classical space by two non-degenerate subspaces of complementary dimensions. Finite Fields Appl., 82:31, 2022], which was later improved for even-dimensional subspaces in [S. P. Glasby, F. Ihringer, and S. Mattheus. The proportion of non-degenerate complementary subspaces in classical spaces. Des. Codes Cryptography, 91(9):2879– 2891, 2023] and generalised in [S.P. Glasby, A.C. Niemeyer, and C.E. Praeger. Random generation of direct sums of finite non-degenerate subspaces. Linear Algebra Appl., 649:408–432, 2022]. The explicit formulae, which give the exact proportion and improve the known lower bounds were derived in the symplectic and Hermitian case in [M. De Boeck and G. Van de Voorde. Anzahl theorems for trivially intersecting subspaces generating a non-singular subspace. I: Symplectic and Hermitian forms. Linear Algebra and its Applications, 699:367–402, 2024]. This paper deals with the more complicated quadratic case.Mathematics Subject Classifications: 51A50, 51E20Keywords: Quadratic forms, counting, non-singular subspace

This paper studies strong blocking sets in the $N$-dimensional finite projective space $\mathrm{PG}(N,q)$. We first show that certain unions of blocking sets cannot form strong blocking sets, which leads to a new lower bound on the size of a strong blocking set in $\mathrm{PG}(N,q)$. Our second main result shows that, for $q>\frac{2}{\ln(2)}(N+1)$, there exists a subset of $2N-2$ lines of a Desarguesian line spread in $\mathrm{PG}(N,q)$, $N$ odd, in higgledy-piggledy arrangement; thus giving rise to a strong blocking set of size $(2N-2)(q+1)$.