This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

A note on strong blocking sets
and higgledy-piggledy sets of lines

Stefano Lia    Geertrui Van de Voorde
Abstract

This paper studies strong blocking sets in the NN-dimensional finite projective space PG(N,q)\mbox{\rm 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 PG(N,q)\mbox{\rm PG}(N,q). Our second main result shows that, for q>2ln(2)(N+1)q>\frac{2}{ln(2)}(N+1), there exists a subset of 2N22N-2 lines of a Desarguesian line spread in PG(N,q)\mbox{\rm PG}(N,q), NN odd, in higgledy-piggledy arrangement; thus giving rise to a strong blocking set of size (2N2)(q+1)(2N-2)(q+1).

1 Introduction

1.1 Strong blocking sets and linear codes

We start by introducing the necessary definitions for blocking sets and linear codes. A tt-fold blocking set in a projective space PG(N,q)\mbox{\rm PG}(N,q), q=phq=p^{h}, pp prime, is a set of points \mathcal{B} such that every hyperplane contains at least tt points of \mathcal{B}. A 11-fold blocking set is simply called a blocking set. Note that in this paper, we only consider blocking sets with respect to hyperplanes. A blocking set \mathcal{B} is called minimal if for every point PP\in\mathcal{B}, the set {P}\mathcal{B}\setminus\{P\} is not a blocking set; that is, every point of \mathcal{B} lies on at least one tangent hyperplane to the set \mathcal{B}. A blocking set in PG(N,q)\mbox{\rm PG}(N,q) is called strong if it meets every hyperplane in a set of points, spanning that hyperplane. Depending on the context, strong blocking sets have also been called cutting blocking sets [4] or generator sets [10] in the literature. It follows from the definition that a strong blocking set in PG(N,q)\mbox{\rm PG}(N,q) is an NN-fold blocking set; but the converse is not necessary true (unless N=2N=2).

The study of 11-fold blocking sets forms a classical problem within finite geometry, and the connection with problems from coding theory (e.g. the study of codewords of small weight in the code of points and lines of a projective plane) has formed an extra motivation for their study. For a survey about 11-fold blocking sets, see [7]. We will now see that strong blocking sets too are connected to coding theory.

A linear code CC over 𝔽q\mathbb{F}_{q} of length nn and dimension kk is a kk-dimensional vector subspace of 𝔽qn\mathbb{F}_{q}^{n}. The vectors of CC are called codewords. A code is called minimal if the support of any codeword vv never properly contains the support of a linearly independent codeword. The support of a codeword is the set of positions in which this codeword is non-zero.

Strong blocking sets were first introduced in [8] in relation to covering codes and saturating sets. A ρ\rho-covering code C𝔽qnC\leq\mathbb{F}_{q}^{n} is a code with the property that every vector in 𝔽qn\mathbb{F}_{q}^{n} has distance at most ρ\rho from a code word of CC, and ρ\rho is the least integer with such property. The integer ρ\rho is the covering radius of CC. A ρ\rho-saturating set in PG(N,q)\mbox{\rm PG}(N,q) is a set 𝒮\mathcal{S} of points such that every point PP of PG(N,q)\mbox{\rm PG}(N,q) lies on a subspace spanned by at most ρ+1\rho+1 points of 𝒮\mathcal{S}. This notion relates to classical problems in algebraic geometry about secant varieties: a ρ\rho-saturating set 𝒮\mathcal{S} can be defined as a set such that the ρ\rho-th secant variety of any variety meeting PG(N,q)\mbox{\rm PG}(N,q) in 𝒮\mathcal{S} contains each point of PG(N,q)\mbox{\rm PG}(N,q).

A strong blocking set in PG(N,q)\mbox{\rm PG}(N,q) forms, by embedding PG(N,q)\mbox{\rm PG}(N,q) in PG(N,qN)\mbox{\rm PG}(N,q^{N}), an (N1)(N-1)-saturating set of PG(N,qN)\mbox{\rm PG}(N,q^{N}), see [8, Theorem 3.2]. Therefore, an upper bound on the minimum size of a strong blocking set leads to a corresponding bound on the minimum size of a saturating set.

In this area, typical problems are to find small upper bounds for the minimum size of a covering code of given covering radius and dimension and to find families of codes with good asymptotic covering density. Strong blocking set can be used to deal with these problems, see for example [9, 8].

More recently, strong blocking sets gained further interest for the coding theory community as they were proved to be in one to one correspondence with minimal codes, [1, 2, 13]; it has been shown that a minimal code of length nn and dimension kk corresponds to a strong blocking set containing nn points in PG(k1,q)\mbox{\rm PG}(k-1,q). Hence, a lower bound on the size of a strong blocking set in PG(k1,q)\mbox{\rm PG}(k-1,q) leads to a lower bound on the length of a minimal [n,k][n,k]-code. We will use this equivalence to translate Theorem 2.6 into the coding theoretical language (see Corollary 2.7.)

1.2 Strong blocking sets and higgledy-piggledy sets

One way of constructing strong blocking sets is to take the union of subspaces in higgledy-piggledy arrangment; where the definition of a set SS of subspaces in higgledy-piggledy arrangment is precisely that the points contained in at least one of the elements of SS form a strong blocking set.

The following results are known for higgledy piggledy line sets in PG(N,q)\mbox{\rm PG}(N,q), NN odd.

Result 1.1.
  • (i)

    [11] A higgledy-piggledy set of lines in PG(N,q)\mbox{\rm PG}(N,q) contains at least N+N2N1qN+\lfloor\frac{N}{2}\rfloor-\lfloor\frac{N-1}{q}\rfloor elements.

  • (ii)

    [10] There exists a higgledy-piggledy set of 2N12N-1 lines in PG(N,q)\mbox{\rm PG}(N,q), NN odd, q2N1q\geq 2N-1.

We will show in Theorem 3.2 that for qq large enough, it is possible to give a construction with one line fewer than in Result 1.1 (ii). More precisely, we show that if q>2ln(2)(N+1)q>\frac{2}{ln(2)}(N+1) there exists a higgledy-piggledy set of lines in PG(N,q)\mbox{\rm PG}(N,q), NN odd, of size 2N22N-2.

It is a natural idea to try and construct higgledy-piggledy sets of subspaces whose elements are contained in a spread. A spread of PG(N,q)\mbox{\rm PG}(N,q) is a set of subspaces partitioning its point set and an elementary construction via field reduction gives rise to Desarguesian spreads. We refer to [12] for more information on field reduction. We see that when a higgledy-piggledy set \mathcal{L} is contained in a Desarguesian spread, it is the image of some point set 𝒫\mathcal{P} under field reduction. The property that \mathcal{L} is a higgledy-piggledy set translates into a property regarding 𝔽q{\mathbb{F}}_{q}-linear sets containing 𝒫\mathcal{P}. More precisely, it was observed in [9] that a set 𝒮\mathcal{S} of points in PG(N12,q2)\mbox{\rm PG}(\frac{N-1}{2},q^{2}) which is not contained in any linear set of rank at most N1N-1 is a higgledy-piggledy of PG(N,q)\mbox{\rm PG}(N,q) under field reduction. In [4], the authors find a set of 77 lines contained in a Desarguesian spread of PG(5,q)\mbox{\rm PG}(5,q) by essentially making use of this point of view; that is, they found a suitable point set of size 77 in PG(2,q2)\mbox{\rm PG}(2,q^{2}). The higgledy-piggledy set found in this paper will be constructed using the elements of a Desarguesian line spread in PG(2n1,q)\mbox{\rm PG}(2n-1,q) rather than a point set in PG(n1,q2)\mbox{\rm PG}(n-1,q^{2}). We will use of the well-known fact that the elementwise stabiliser of a Desarguesian line spread acts transitively on the points of each spread element (see e.g. [12]). A corollary of this property is the following:

Result 1.2.

Let 𝒮\mathcal{S} be a subset of a Desarguesian line spread 𝒟\mathcal{D} in PG(N,q)\mbox{\rm PG}(N,q), NN odd, and let P1P_{1} and P2P_{2} be points lying on the same line LL of 𝒟\mathcal{D}. Let sis_{i} be the number of tt-dimensional subspaces π\pi through PiP_{i} such that π\pi meets all elements of 𝒮\mathcal{S}. Then s1=s2s_{1}=s_{2}.

Remark 1.3.

A related result was recently derived in [6], where the authors show that for NN sufficiently large, there exists a strong blocking set in PG(N,q)\mbox{\rm PG}(N,q) of size 2N+2logq(q4q3q+1)(q+1)\frac{2N+2}{\log_{q}(\frac{q^{4}}{q^{3}-q+1})}(q+1) by using a union of a set of lines through the origin that forms a blocking set with respect to co-dimension 22-spaces in an affine space. Note this strong blocking set arises from a line set in an affine space which is then projected onto the projective space so it does not arise from a higgledy-piggledy set of lines.

2 Strong blocking sets arising from the union of blocking sets

We have seen in the introduction that every strong blocking set in PG(N,q)\mbox{\rm PG}(N,q) is an NN-fold blocking set. It is easy to see that a line and a Baer subplane are both blocking sets in PG(N,q)\mbox{\rm PG}(N,q). Furthermore, it is well-known that if a blocking set in PG(N,q)\mbox{\rm PG}(N,q) does not contain a line, it has size at least that of a Baer subplane [5]. For the motivation of this section, consider the case PG(3,q)\mbox{\rm PG}(3,q): in that case, every strong blocking set is a triple blocking set but, as mentioned before, the union of three disjoint blocking sets does not necessarily give rise to a strong blocking set. We also know from Theorem 1.1 that it is not possible for the union of 33 lines (which are blocking sets) to form a strong blocking set in PG(3,q)\mbox{\rm PG}(3,q).

The following result from [4], which is valid in PG(3,q)\mbox{\rm PG}(3,q) where qq is a third power, is noteworthy in this context.

Result 2.1.

There exists three subgeometries PG(3,q1/3)\mbox{\rm PG}(3,q^{1/3}) in PG(3,q)\mbox{\rm PG}(3,q), q=q03q=q_{0}^{3}, whose union forms a strong blocking set of size 3(q+q2/3+q1/3+1).3(q+q^{2/3}+q^{1/3}+1).

This shows that it is possible to construct a strong blocking set as the union of three blocking sets; but not from three lines. This motivated the question on which unions of blocking sets in PG(3,q)\mbox{\rm PG}(3,q), and more generally, PG(N,q)\mbox{\rm PG}(N,q), can give rise to strong blocking sets. A result of Barát and Storme [3] (Result 2.5) shows that a NN-fold blocking set in PG(N,q)\mbox{\rm PG}(N,q) of small size necessarily contains the union of NN disjoint lines and/or Baer subplanes. So if a strong blocking set is small, it necessarily contains the union of lines and Baer subplanes, which explains why we investigate such unions.

Result 1.1(i) shows that a set of lines of PG(N,q)\mbox{\rm PG}(N,q), qNq\geq N, forming a strong blocking set contains at least N+N/2N+\lfloor N/2\rfloor lines. We first derive a similar result for lines and Baer subplanes in Corollary 2.3.

Lemma 2.2.

Let qN2q\geq N^{2}, N3N\geq 3. Let 𝒮=i=1kBi\mathcal{S}=\bigcup_{i=1}^{k}B_{i} be a strong blocking set of PG(N,q)\mathrm{PG}(N,q), given by the union of kk disjoint minimal blocking sets BiB_{i} that are either lines are Baer subplanes. Then no hyperplane contains all but at most N1N-1 of the sets BiB_{i}.

Proof.

Let HH be an hyperplane containing all but at most (n1)(n-1) of the sets BiB_{i}, and relabel the sets BiB_{i} that are not contained in HH as B1,,BsB_{1},\ldots,B_{s}, where sn1s\leq n-1. Since each BiB_{i} is a blocking set, we find (at least) one point, say PiP_{i} contained in BiHB_{i}\cap H, i=1,,si=1,\ldots,s. The ss points P1,P2,,PsP_{1},P_{2},\ldots,P_{s}, span at most an (n2)(n-2)-dimensional space of HH so they are contained in some n2n-2-dimensional space HH^{\prime} which is a hyperplane of HH. There are q+1q+1 hyperplanes of PG(N,q)\mbox{\rm PG}(N,q) through HH^{\prime}, one of which is HH and contains Bs+1,,BkB_{s+1},\ldots,B_{k}. Of the other qq hyperplanes, at most (N1)(q+1)(N-1)(\sqrt{q}+1) contain further points of 𝒮\mathcal{S}: there are at most N1N-1 blocking sets BiB_{i} not contained in HH, and the point PiP_{i} lies on at most q+1\sqrt{q}+1 lines in BiB_{i} containing further points of BiB_{i}. Since qN2q\geq N^{2}, we have that NqN\leq\sqrt{q}, hence (N1)(q+1)q1<q(N-1)(\sqrt{q}+1)\leq q-1<q. It follows that at least one hyperplane π\pi through HH^{\prime} does not contain any points of 𝒮\mathcal{S} outside of HH^{\prime}. Since π\pi meets 𝒮\mathcal{S} in a set not spanning π\pi, 𝒮\mathcal{S} is not a strong blocking set. ∎

We obtain the following corollary.

Corollary 2.3.

Let qN2q\geq N^{2}. The union of ii lines and kk Baer subplanes in PG(N,q)\mbox{\rm PG}(N,q), with iN2i\leq\lfloor\frac{N}{2}\rfloor and kN1k\leq N-1 is not a strong blocking set.

Proof.

Let B1,,BiB_{1},\ldots,B_{i} be the ii lines and Bi+1,,Bi+kB_{i+1},\ldots,B_{i+k} be the kk Baer subplanes. Since ii lines span at most a 2i12i-1-dimensional space, there is a hyperplane containing B1,,BiB_{1},\ldots,B_{i}. Since kN1k\leq N-1, the result follows from Lemma 2.2.

In the case that we only have k=Nk=N sets BiB_{i} making up the set 𝒮\mathcal{S}, it is trivially true (when N3N\geq 3) that all but N1N-1 of those NN are contained in a hyperplane of PG(N,q)\mbox{\rm PG}(N,q).

Corollary 2.4.

Let qN2q\geq N^{2}. The union of NN lines and/or subplanes does not form a strong blocking set in PG(N,q)\mbox{\rm PG}(N,q).

In [3], Barát and Storme showed the following.

Result 2.5.

Let BB be a minimal ss-fold blocking set in PG(N,q)\mbox{\rm PG}(N,q), q=phq=p^{h}, pp prime, N3N\geq 3, q>661q>661, with

|B|<sq+cpq2/3(s1)(s2)/2,|B|<sq+c_{p}q^{2/3}-(s-1)(s-2)/2,

where s<min(cpq1/6,q1/4/2)s<\min(c_{p}q^{1/6},q^{1/4}/2), c2=c3=21/3c_{2}=c_{3}=2^{-1/3} and cp=1c_{p}=1 for p>3p>3. Then BB contains the disjoint union of ss disjoint lines and/or Baer subplanes.

Combining the results by Barat and Storme on ss-fold blocking sets with the previous lemma we have the following non-existence result.

Theorem 2.6.

The size of a strong blocking set in PG(N,q)\mbox{\rm PG}(N,q), N3N\geq 3, q=phq=p^{h}, pp prime, qmax{661,apN6,16N4}q\geq\max\{661,a_{p}N^{6},16N^{4}\}, where ap=4a_{p}=4 for p=2,3p=2,3 and ap=1a_{p}=1 for p>3p>3,

is at least

Nq+cpq2/3(N1)(N2)/2,Nq+c_{p}q^{2/3}-(N-1)(N-2)/2,
Proof.

Assume to the contrary that 𝒮\mathcal{S} is a strong blocking set of size S<Nq+cpq2/3(N1)(N2)/2S<Nq+c_{p}q^{2/3}-(N-1)(N-2)/2. Then 𝒮\mathcal{S} is an NN-fold blocking set. Let BB be the a minimal NN-fold blocking set contained in 𝒮\mathcal{S}. By Result 2.5, BB contains a set BB^{\prime} which is the disjoint union of NN lines and/or Baer subplanes. From Corollary 2.4, we know that there is a hyperplane HH meeting BB^{\prime} in points spanning at most an (N2)(N-2)-space. Let π\pi be that (N2)(N-2)-space. There are at most Nq+cpq2/3(N1)(N2)/2N(q+1)<q+1Nq+c_{p}q^{2/3}-(N-1)(N-2)/2-N(q+1)<q+1 points in 𝒮\mathcal{S}\setminus\mathcal{B^{\prime}}. Hence, at least one hyperplane through π\pi contains no further points of 𝒮\mathcal{S}, a contradiction since 𝒮\mathcal{S} is a strong blocking set.

Using the correspondence between minimal codes and strong blocking sets introduced in Subsection 1.1, we obtain the following corollary.

Corollary 2.7.

A minimal code of dimension kk over 𝔽q{\mathbb{F}}_{q}, q=phq=p^{h}, pp prime, qmax{661,(k1)2}q\geq\max\{661,(k-1)^{2}\}, has length at least

(k1)q+cpq2/3(k2)(k3)/2.(k-1)q+c_{p}q^{2/3}-(k-2)(k-3)/2.
Remark 2.8.

Going through the details of the paper [3], we see that for the case N=3N=3, the bound q>661q>661 can be improved to q>9q>9. Hence, for this particular case, we have showed that the size of a strong blocking set in PG(3,q)\mbox{\rm PG}(3,q), q>9q>9, is at least 3q+cpq2/313q+c_{p}q^{2/3}-1; and that a minimal code of dimension 44 over GF(q)GF(q), q>9q>9, has length at least 3q+cpq2/313q+c_{p}q^{2/3}-1.

3 Construction of a higgledy-piggledy set of lines of size 2N22N-2rising from a spread

In this section, we derive our second main theorem. For ease of notation, since NN is odd, we will use N=2n1N=2n-1 throughout this section. We will show that if q4nln(2)q\leq\frac{4n}{ln(2)}, there exists a higgledy-piggledy line set of size 4n44n-4 contained in a Desarguesian spread of PG(2n1,q)\mbox{\rm PG}(2n-1,q). We construct this higgledy-piggledy set in two parts: in the next lemma, we will find a suitable set of 2n12n-1 lines, which we will extend in the main theorem to a higgledy-piggledy set of size 4n44n-4.

Lemma 3.1.

Let q4nq\geq 4n, n2n\geq 2. There exists a set of 2n12n-1 lines \mathcal{L} of a Desarguesian spread 𝒟\mathcal{D} in PG(2n1,q)\mathrm{PG}(2n-1,q) such that the number of (2n3)(2n-3)-spaces meeting all lines of \mathcal{L} is at most 2n(q+1)2n32n(q+1)^{2n-3}.

Proof.

We will use induction on nn to show that there exist:

  • a set of 2n22n-2 lines \mathcal{L} of a Desarguesian spread 𝒟\mathcal{D} in PG(2n1,q)\mbox{\rm PG}(2n-1,q) such that the number of (2n3)(2n-3)-spaces meeting all lines of \mathcal{L} is at most (n1)(q+1)2n2(n-1)(q+1)^{2n-2};

  • a line MM of 𝒟\mathcal{D} such that

    • the number of (2n3)(2n-3)-spaces meeting MM in exactly a point and meeting all lines of \mathcal{L} is at most 2(n1)(q+1)2n32(n-1)(q+1)^{2n-3}, and

    • the number of (2n3)(2n-3)-spaces containing MM and meeting all lines of \mathcal{L} is at most 2(n1)(q+1)2n42(n-1)(q+1)^{2n-4}.

Consider the base case n=2n=2. Let \mathcal{L} be any two distinct lines of a Desarguesian spread in PG(3,q)\mbox{\rm PG}(3,q). It is clear that the number of lines meeting both lines of \mathcal{L} is precisely (q+1)2(q+1)^{2}. Furthermore, let MM be any line of the Desarguesian spread, not in \mathcal{L}. Then the lines meeting the three lines of {M}\mathcal{L}\cup\{M\} are precisely the q+12(q+1)q+1\leq 2(q+1) lines of the opposite regulus determined by \mathcal{L} and there is no line containing MM and meeting the two lines of \mathcal{L}.

So now assume that there is a set \mathcal{L} of 2n42n-4 lines of a Desarguesian spread 𝒟Σ\mathcal{D}_{\Sigma} in Σ=PG(2n3,q)\Sigma=\mbox{\rm PG}(2n-3,q) such that the number of (2n5)(2n-5)-spaces meeting all lines of \mathcal{L} is at most (n2)(q+1)2n4(n-2)(q+1)^{2n-4}, and a line MM, not in \mathcal{L} such that the number of (2n5)(2n-5)-spaces meeting all lines of \mathcal{L} meeting MM in a point is at most 2(n2)(q+1)2n52(n-2)(q+1)^{2n-5} and the number of (2n5)(2n-5)-spaces containing MM and meeting all lines of \mathcal{L} is at most 2(n2)(q+1)2n62(n-2)(q+1)^{2n-6}.

Now embded Σ\Sigma in PG(2n1,q)\mbox{\rm PG}(2n-1,q) and extend the Desarguesian spread 𝒟Σ\mathcal{D}_{\Sigma} in Σ\Sigma to a Desarguesian spread 𝒟\mathcal{D} in PG(2n1,q)\mbox{\rm PG}(2n-1,q). Let M0M_{0} and M1M_{1} be two lines of 𝒟\mathcal{D}, not in Σ\Sigma such that the 33-space μ=M0,M1\mu=\langle M_{0},M_{1}\rangle meets Σ\Sigma precisely in the line MM. We will first show that the number of (2n3)(2n-3)-spaces meeting {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\} is at most (n1)(q+1)2n2(n-1)(q+1)^{2n-2}.

Any (2n3)(2n-3)-space SS meeting all lines of {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\} meets Σ\Sigma in either a (2n4)(2n-4)-dimensional or a (2n5)(2n-5)-dimensional space.

First consider the (2n3)(2n-3)-spaces meeting Σ\Sigma in a hyperplane of Σ\Sigma. Note that in the case that SS meets Σ\Sigma in a hyperplane of Σ\Sigma, it is impossible that SS contains μ\mu, since M0M_{0} is contained in μ\mu and disjoint from Σ\Sigma.

Each of the q2n3+q2n4q^{2n-3}+q^{2n-4} hyperplanes HH of Σ\Sigma meeting MM in exactly a point give rise to exactly one (2n3)(2n-3)-space meeting all lines of {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\}, namely the (2n3)(2n-3)-space spanned by HH and the unique transversal line to M0,M1M_{0},M_{1} through HMH\cap M. Each of the q2n41q1\frac{q^{2n-4}-1}{q-1} hyperplanes of Σ\Sigma through MM gives rise to q+1q+1 (2n3)(2n-3)-spaces meeting all lines of {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\}, namely one for each of the q+1q+1 planes of μ\mu through MM. This gives us q2n3+q2n4+q2n41q1(q+1)q^{2n-3}+q^{2n-4}+\frac{q^{2n-4}-1}{q-1}(q+1) subspaces meeting all lines of {M0,M1}\mathcal{L}\cap\{M_{0},M_{1}\} and meeting Σ\Sigma in a hyperplane. This number is smaller than 2q2n32q^{2n-3} if q3q\geq 3.

Now consider spaces meeting all lines of {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\} and meeting Σ\Sigma in a (2n5)(2n-5)-space. We will make a distinction depending on their intersection size with the line MM.

First consider such spaces SS containing the line MM. Each of the (2n5)(2n-5)-spaces τ\tau meeting all lines of \mathcal{L} and containing MM lies on at most (q+1)(q2+q+1)(q+1)(q^{2}+q+1) (2n3)(2n-3)-spaces meeting all lines of {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\} since each of the q+1q+1 planes through MM in μ\mu gives rise to a (2n4)(2n-4)-space meeting all lines of {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\}, and each of those (2n4)(2n-4)-spaces lies on q2+q+1q^{2}+q+1 (2n3)(2n-3)-spaces. There are at most 2(n2)(q+1)2n62(n-2)(q+1)^{2n-6} such (2n5)(2n-5)-spaces τ\tau.

Each of the (2n5)(2n-5)-spaces τ\tau meeting all lines of \mathcal{L} and meeting MM in a point lies on at most (q2+q+1)(q^{2}+q+1) (2n3)(2n-3)-spaces meeting all lines of {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\} namely one for each of the (q2+q+1)(q^{2}+q+1) (2n3)(2n-3)-spaces through the unique (2n4)(2n-4)-space spanned by the (2n5)(2n-5)-space τ\tau and the unique transversal line through the point τμ\tau\cap\mu to the regulus defined by M0,M1,MM_{0},M_{1},M. There are at most 2(n2)(q+1)2n52(n-2)(q+1)^{2n-5} such (2n5)(2n-5)-spaces τ\tau.

Finally, each of the (2n5)(2n-5)-spaces τ\tau meeting all lines of \mathcal{L} but not intersecting MM lie on (q+1)2(q+1)(q+1)^{2}-(q+1) (2n3)(2n-3)-spaces intersecting all lines of {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\}, namely those spanned by τ\tau and a line meeting both M0M_{0} and M1M_{1}, but not MM (if the subspace SS would meet MM, then SS would meet Σ\Sigma in (2n4)(2n-4)-space). There are at most (n2)(q+1)2n4(n-2)(q+1)^{2n-4} such (2n5)(2n-5)-spaces τ\tau.

We find that the total number of (2n3)(2n-3)-spaces SS meeting all lines of {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\} is at most

2q2n3+2(n2)(q+1)2n6(q+1)(q2+q+1)+2(n2)(q+1)2n5(q2+q+1)2q^{2n-3}+2(n-2)(q+1)^{2n-6}(q+1)(q^{2}+q+1)+2(n-2)(q+1)^{2n-5}(q^{2}+q+1)
+(n2)(q+1)2n4(q+1)2(n1)(q+1)2n2,+(n-2)(q+1)^{2n-4}(q+1)^{2}\leq(n-1)(q+1)^{2n-2},

since q4nq\geq 4n.

We will now show that there is a line NN such that the number of (2n3)(2n-3)-spaces meeting NN in a point and meeting the lines {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\} is at most 2(n1)(q+1)2n32(n-1)(q+1)^{2n-3}, while the number of (2n3)(2n-3)-spaces containing NN and meeting the lines {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\} is at most 2(n1)(q+1)2n42(n-1)(q+1)^{2n-4}.

We already know that there is a set 𝒮\mathcal{S} of at most (n1)(q+1)2n2(n-1)(q+1)^{2n-2} (2n3)(2n-3)-spaces SS meeting the lines {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\}. Each of those spaces covers q2n21q1\frac{q^{2n-2}-1}{q-1} points. Since there are q2n1q1(2n2)(q+1)\frac{q^{2n}-1}{q-1}-(2n-2)(q+1) points not on the lines \mathcal{L}, it follows that there exists a point PP, not on a line of {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\} such that the number of spaces of 𝒮\mathcal{S} through it is at most

(n1)(q+1)2n2q2n21q1q2n1q1(2n2)(q+1)2(n1)(q+1)2n4.\frac{(n-1)(q+1)^{2n-2}\frac{q^{2n-2}-1}{q-1}}{\frac{q^{2n}-1}{q-1}-(2n-2)(q+1)}\leq 2(n-1)(q+1)^{2n-4}.

Let NN be the spread element of 𝒟\mathcal{D} through PP and let 𝒮P\mathcal{S}_{P} be the subset of spaces of 𝒮\mathcal{S} containing PP. Let xx be the number of spaces of 𝒮P\mathcal{S}_{P} containing NN, and yy is the number of spaces of 𝒮P\mathcal{S}_{P} not containing NN; we have just seen that x+y2(n1)(q+1)2n4x+y\leq 2(n-1)(q+1)^{2n-4} Since the lines of {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\}, as well as NN are elements of 𝒟\mathcal{D}, we find that the the number of (2n3)(2n-3)-spaces meeting all lines of 𝒮\mathcal{S} is given by x+(q+1)y.x+(q+1)y. The number of (2n3)(2n-3)-spaces meeting all lines of {M0,M1}\mathcal{L}\cup\{M_{0},M_{1}\} and meeting NN exactly in a point is (q+1)y(q+1)(x+y)2(n1)(q+1)2n4(q+1)=2(n1)(q+1)2n3.(q+1)y\leq(q+1)(x+y)\leq 2(n-1)(q+1)^{2n-4}(q+1)=2(n-1)(q+1)^{2n-3}.

Finally, observe that, since q>4nln(2)q>\frac{4n}{ln(2)}, 2n(q+1)2n3>2(n1)(q+1)2n3+2(n1)(q+1)2n42n(q+1)^{2n-3}>2(n-1)(q+1)^{2n-3}+2(n-1)(q+1)^{2n-4}.

The statement now follows by induction. ∎

Theorem 3.2.

Let Σ\Sigma be the space PG(2n1,q)\mbox{\rm PG}(2n-1,q), with n2n\geq 2 and q>4n/ln(2)q>4n/ln(2). There exists a higgledy-piggledy set of size at most 2(2n1)22(2n-1)-2, that is, a strong blocking set 𝒮\mathcal{S} in Σ\Sigma which is the union of at most 4n44n-4 lines 1,,4n4\ell_{1},\dots,\ell_{4n-4}.

Proof.

Let 𝒟\mathcal{D} denote the Desarguesian line spread of Σ\Sigma, and let ={1,,2n1}\mathcal{L}=\{\ell_{1},\dots,\ell_{2n-1}\} be a set of lines as obtained in Lemma 3.1. We will show that we can add lines 2n,2n+1,,4n4\ell_{2n},\ell_{2n+1},\ldots,\ell_{4n-4} to \mathcal{L} such that there is no subspace of dimension (2n3)(2n-3) meeting all lines 1,,4n4\ell_{1},\ldots,\ell_{4n-4}. Since it is possible that i=j\ell_{i}=\ell_{j} for some i,ji,j, we will eventually obtain a set of at most 4n44n-4 lines which is a higgledy-piggledy set 𝒮\mathcal{S}: if KK is a hyperplane, it meets 𝒮\mathcal{S} in at least 2n12n-1 points arising from the intersections of KK with the lines of \mathcal{L}, and by construction it is impossible that all points of 𝒮K\mathcal{S}\cap K are contained in a hyperplane of KK.

We double count the number of pairs

(H,Q)(H,Q)

such that QHQ\in H and HH is an (2n3)(2n-3)-space with HH\cap\ell\neq\emptyset for any \ell\in\mathcal{L}.

By Lemma 3.1, this number is at most

2n(q+1)2n3θ2n3;2n(q+1)^{2n-3}\theta_{2n-3};

where θ2n3=(q2n21)/(q1)\theta_{2n-3}=(q^{2n-2}-1)/(q-1) is the number of points of HH.
On the other hand, the number of such pairs is also

θ2n1M1;\theta_{2n-1}M_{1};

where M1M_{1} is the average number of (2n3)(2n-3)-dimensional spaces HH meeting each of the lines i\ell_{i}, i=1,,2n1i=1,\dots,2n-1 in at least a point and through a point QΣQ\in\Sigma.

As a consequence

M12n(q+1)2n3θ2n3θ2n1.M_{1}\leq\frac{2n(q+1)^{2n-3}\theta_{2n-3}}{\theta_{2n-1}}.

In particular, there exists a point QQ with the property that the number of (2n3)(2n-3)-spaces through QQ meeting each of the lines i\ell_{i}, i=1,,2n1i=1,\dots,2n-1 in at least a point is at most M1M_{1}. By Result 1.2, the unique line 2n\ell_{2n} of the spread 𝒟\mathcal{D} passing through QQ has the property that there are at most (q+1)M1(q+1)M_{1} (2n3)(2n-3)-spaces meeting 2n\ell_{2n} and each of the lines i\ell_{i}, i=1,,2n1i=1,\dots,2n-1 in at least a point. Note that QQ might be a point of one of the lines i\ell_{i}, namely in such a case 2n\ell_{2n}\in\mathcal{L}. The number of pairs

(H,Q)(H,Q)

such that HiH\cap\ell_{i}\neq\emptyset for any i=1,,2ni=1,\dots,2n and QQ belongs to HH, is now at most

(q+1)M1θ2n3.(q+1)M_{1}\theta_{2n-3}.

On the other hand, this number is also

θ2n1M2;\theta_{2n-1}M_{2};

where M2M_{2} is the average number of (2n3)(2n-3)-dimensional spaces HH through a fixed point QQ and meeting each of the lines i\ell_{i}, i=1,,2ni=1,\dots,2n in at least a point. As a consequence

M2(q+1)M1θ2n3θ2n1M_{2}\leq\frac{(q+1)M_{1}\theta_{2n-3}}{\theta_{2n-1}}

We can iterate the reasoning, taking each time a new line 2n1+i\ell_{2n-1+i} contained in at most MiM_{i} (n2)(n-2)-dimensional spaces HH meeting each of the previous lines, and double counting the pairs (H,Q)(H,Q) such that HSiH\cap S_{i}\neq\emptyset and QQ belongs to HH. We obtain

Mi<(q+1)Mi1θ2n3θ2n1.M_{i}<\frac{(q+1)M_{i-1}\theta_{2n-3}}{\theta_{2n-1}}.

Combining with M1<2n(q+1)2n3θ2n3θ2n1M_{1}<\frac{2n(q+1)^{2n-3}\theta_{2n-3}}{\theta_{2n-1}}, we obtain

Mi<2n(q+1)2n3+i1θ2n3iθ2n1i.M_{i}<\frac{2n(q+1)^{2n-3+i-1}\theta_{2n-3}^{i}}{\theta_{2n-1}^{i}}.

In particular,

M2n3<2n(q+1)4n7θ2n32n3θ2n12n3=2n(q+1)4n7(q2n21q2n1)2n3<2n(q+1)4n7(1q2)2n3M_{2n-3}<\frac{2n(q+1)^{4n-7}\theta_{2n-3}^{2n-3}}{\theta_{2n-1}^{2n-3}}=2n(q+1)^{4n-7}\left(\frac{q^{2n-2}-1}{q^{2n}-1}\right)^{2n-3}<2n(q+1)^{4n-7}\left(\frac{1}{q^{2}}\right)^{2n-3}

Observe that

(q+1)4n7<q4n7+(4n6)q4n8,(q+1)^{4n-7}<q^{4n-7}+(4n-6)q^{4n-8},

holds for any qq such that

q>1eln(2)/(4n7)1.q>\frac{1}{e^{ln(2)/(4n-7)}-1}.

Indeed (q+1)4n7<q4n7+(4n6)q4n8(q+1)^{4n-7}<q^{4n-7}+(4n-6)q^{4n-8} is equivalent to (1+1/q)4n7<1+4n6q(1+1/q)^{4n-7}<1+\frac{4n-6}{q}. Assuming q>4n6q>4n-6, the right hand side of this inequality is at most 22. Isolating qq, we obtain the claim. Therefore,

M2n3<2n(1q+4n6q2).M_{2n-3}<2n\left(\frac{1}{q}+\frac{4n-6}{q^{2}}\right).

Finally, 2n(1q+4n6q2)<12n\left(\frac{1}{q}+\frac{4n-6}{q^{2}}\right)<1 is equivalent to q22nq4n+6>0q^{2}-2nq-4n+6>0, which is always true under our hypothesis. It can be checked that if q>4n/ln(2)q>4n/ln(2) and n2n\geq 2, then q>1eln(2)/(4n7)1q>\frac{1}{e^{ln(2)/(4n-7)}-1} as well. Since M2n3<1M_{2n-3}<1, there must be a point not contained in any (2n3)(2n-3)-subspace meeting all the lines i\ell_{i}, i=1,,4n5i=1,\dots,4n-5. Again using Result 1.2, we see that the unique line 4n4\ell_{4n-4} through that point is such that there is no (2n3)(2n-3)-subspace meeting all the lines i\ell_{i}, i=1,,4n4i=1,\dots,4n-4. ∎

Acknowledgments

The first author acknowledges the support by the Irish Research Council, grant n. GOIPD/2022/307 and by the Italian institute for high mathematics INdAM, as “titolare di una borsa per l’estero dell’Istituto Nazionale di Alta Matematica”.

References

  • [1] Gianira N. Alfarano, Martino Borello, and Alessandro Neri. A geometric characterization of minimal codes and their asymptotic performance. Advances in Mathematics of Communications, 16(1):115–133, 2022.
  • [2] Gianira N. Alfarano, Martino Borello, Alessandro Neri, and Alberto Ravagnani. Three combinatorial perspectives on minimal codes. SIAM J. Discrete Math., 36(1):461–489, 2022.
  • [3] János Barát and Leo Storme. Multiple blocking sets in PG(n,q),n3{\rm PG}(n,q),\ n\geq 3. Des. Codes Cryptogr., 33(1):5–21, 2004.
  • [4] Daniele Bartoli, Antonio Cossidente, Giuseppe Marino, and Francesco Pavese. On cutting blocking sets and their codes. Forum Math., 34(2):347–368, 2022.
  • [5] Albrecht Beutelspacher. Blocking sets and partial spreads in finite projective spaces. Geom. Dedicata, 9(4):425–449, 1980.
  • [6] Anurag Bishnoi, Jozefien D’haeseleer, Dion Gijswijt, and Aditya Potukuchi. Blocking sets, minimal codes and trifferent codes. arXiv e-prints, page arXiv:2301.09457, January 2023.
  • [7] Aart Blokhuis, Peter Sziklai, and Tamás Szőnyi. Blocking sets in projective spaces. Current research topics in Galois geometry, page 61–84, 2011.
  • [8] Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, and Fernanda Pambianco. Linear nonbinary covering codes and saturating sets in projective spaces. Adv. Math. Commun., 5(1):119–147, 2011.
  • [9] Lins Denaux. Higgledy-piggledy sets in projective spaces of small dimension. Electron. J. Combin., 29(3):Paper No. 3.29, 25, 2022.
  • [10] Szabolcs L. Fancsali and Péter Sziklai. Lines in higgledy-piggledy arrangement. Electron. J. Combin., 21(2):Paper 2.56, 15, 2014.
  • [11] Tamás Héger and Zoltán Lóránt Nagy. Short minimal codes and covering codes via strong blocking sets in projective spaces. IEEE Trans. Inform. Theory, 68(2):881–890, 2022.
  • [12] Michel Lavrauw and Geertrui Van de Voorde. Field reduction and linear sets in finite geometry. In Topics in finite fields, volume 632 of Contemp. Math., pages 271–293. Amer. Math. Soc., Providence, RI, 2015.
  • [13] Chunming Tang, Yan Qiu, Qunying Liao, and Zhengchun Zhou. Full characterization of minimal linear codes as cutting blocking sets. IEEE Transactions on Information Theory, 67(6):3690–3700, 2021.