Properties of sets of Subspaces with Constant Intersection Dimension
Lisa Hernandez Lucas
111Address: Department of Mathematics, Vrije Universiteit Brussel, Pleinlaan 2, 1050 Brussels, Belgium
Email address: [email protected]
Website: http://homepages.vub.ac.be/~lihernan/
Abstract
A (k,kβt)-SCID (set of Subspaces with Constant Intersection Dimension) is a set of k-dimensional vector spaces that have pairwise intersections of dimension kβt. Let C={Ο1β,β¦,Οnβ} be a (k,kβt)-SCID. Define S:=β¨Ο1β,β¦,Οnββ© and I:=β¨Οiββ©Οjββ£1β€i<jβ€nβ©. We establish several upper bounds for dimS+dimI in different situations. We give a spectrum result for the case (nβ1)(kβt)β€k and for the case nβ€qtβ1qt(nβΞ·)β1β, giving examples of (k,kβt)-SCIDs reaching a large interval of values for dimS+dimI.
1 Introduction
Let V be a vector space over a finite field Fqβ. Let k and t be integers such that tβ€k. A set C of k-dimensional subspaces of V that have pairwise intersections of dimension kβt is called a (k,kβt)-SCID. The acronym SCID stands for a set of Subspaces with Constant Intersection Dimension.
SCIDs are introduced in [3], where a similar definition is given in terms of projective spaces instead of vector spaces. For our purposes however, the ambient space will always be a vector space V over a finite field Fqβ of order q. The dimension of this vector space V does not need to be predefined.
In the domain of coding theory, SCIDs are better known as equidistant codes.
These codes are relevant in a random network coding setting, where information is sent through a network with varying topology. This network is depicted as a directed multigraph where the information has to be transmitted from the sources to the sinks through some intermediary nodes. Within network coding, these intermediary nodes apply coding to the received inputs, instead of simply routing them. It was shown in [1] that the maximal information rate of a network with one source can be achieved by applying this technique. When the order of the ground field is large enough, it is sufficient to only apply linear network coding, where the nodes transmit linear combinations of the input they receive [8].
Random network coding is when the nodes output random linear combinations of the input, instead of using a predefined scheme. The concept and benefits of random network coding in a multi-source setting are explored in [5], and later on approached mathematically through subspace codes in [6].
A subspace code is a code that has vector subspaces as codewords. Note that this is different from the classical case, where the codewords are vectors. The distance between two codewords U and V from a subspace code is called the subspace distance and is defined as d(U,V)=dimU+dimVβ2dim(Uβ©V). When all codewords have the same dimension, the code is called a constant dimension code. When in addition all pairwise intersections have the same dimension, then the distance between any two codewords is constant. In this case we say we have an equidistant code, see e.g. [4]. It should now be clear why these codes correspond to SCIDs.
Note that in the definition of a SCID, it is required that all pairwise intersections have the same dimension. It is not necessary that they all coincide. If this is the case, then the SCID is called a (k,kβt)-sunflower. The (kβt)-space that all the elements of the sunflower have in common, is often called the center of the sunflower. Sunflowers have been investigated before, see for instance [2].
Another special case of SCIDs occurs when k=t, i.e. when every two distinct elements intersect trivially. A (k,0)-SCID is called a partial k-spread. Note that a partial k-spread is also a (k,0)-sunflower with trivial center. Partial spreads are studied thoroughly within the domain of finite geometry, see for example [9] and [10].
From now on, we will assume that a SCID contains at least two elements. The following lemma follows directly from the definitions:
Lemma 1.1**.**
A subset of a (k,kβt)-SCID (resp. (k,kβt)-sunflower), containing at least two elements, is again a (k,kβt)-SCID (resp. (k,kβt)-sunflower).
Let C={Ο1β,β¦,Οnβ} be a (k,kβt)-SCID with n elements. Define the following two spaces:
[TABLE]
Intuitively, when the space S has large dimension, the elements of C are further apart, causing the dimension of I to be smaller and vice versa. This raises the question: is it possible to give an upper bound on dimS+dimI?
The article is structured as follows: In Section 2, we establish several upper bounds for different situations. In Section 3, we give a spectrum result for the case (nβ1)(kβt)β€k and for the case nβ€qtβ1qt(nβΞ·)β1β, giving examples of (k,kβt)-SCIDs reaching a large interval of values for dimS+dimI.
2 Upper bounds on dimS+dimI
In this section, we justify the intuition from the previous section by giving upper bounds on the sum dimS+dimI. When an upper bound is established on this sum, it is clear that for a large dimension of S, the dimension of I must be small, and vice versa. We give several upper bounds and compare them for different values of nβ₯2, k and t. At the end of this section, a summary of the best bounds is given in Table 1.
Theorem 2.1 gives a bound that is valid for all values of nβ₯2, k and t.
Theorem 2.1**.**
Let C={Ο1β,β¦,Οnβ} be a (k,kβt)-SCID, nβ₯2. Define S:=β¨Ο1β,β¦,Οnββ© and I:=β¨Οiββ©Οjββ£1β€i<jβ€nβ©. Then:
[TABLE]
Proof.
The proof is by induction on the number of spaces n. For the induction base, assume n=2. Then C={Ο1β,Ο2β}. Hence, S=β¨Ο1β,Ο2ββ© has dimension k+t and I=Ο1ββ©Ο2β has dimension kβt. In this case, dimS+dimI=2k, agreeing with the theorem.
Now assume the theorem is true for nβ1. Define Cβ²:={Ο1β,β¦,Οnβ1β}, then Cβ² is a (k,kβt)-SCID by Lemma 1.1. Hence, if we define Sβ²:=β¨Ο1β,β¦,Οnβ1ββ© and Iβ²:=β¨Οiββ©Οjββ£1β€i<jβ€nβ1β©, then dimSβ²+dimIβ²β€(nβ1)k, by the induction hypothesis.
Define A:=β¨Ο1ββ©Οnβ,Ο2ββ©Οnβ,β¦,Οnβ1ββ©Οnββ©, so A is the space spanned by all intersections of Ο1β,β¦,Οnβ1β with the space Οnβ. Then kβtβ€dimAβ€k, since Ο1ββ©ΟnββAβΟnβ. Note that I=β¨Iβ²,Aβ©, such that:
[TABLE]
Let 0β€Ξ΄β€t be such that dimA=kβt+Ξ΄, then:
[TABLE]
On the other hand, from S=β¨Sβ²,Οnββ©, it follows:
[TABLE]
But AβΟnββ©Sβ², hence dim(Οnββ©Sβ²)β₯dimA=kβt+Ξ΄. Together with dimΟnβ=k, this results in the following inequality:
[TABLE]
Combining (1) and (2) with the induction hypothesis, we find:
[TABLE]
which concludes the proof.
β
The natural question that arises now is whether this bound is sharp. In Theorem 2.2, a construction of a SCID reaching this upper bound is given, under the assumption that (nβ1)(kβt)β€k. Hence, under this assumption, the bound given in Theorem 2.1 is sharp.
Theorem 2.2**.**
Let C={Ο1β,β¦,Οnβ} be a (k,kβt)-SCID. Define S:=β¨Ο1β,β¦,Οnββ© and I:=β¨Οiββ©Οjββ£1β€i<jβ€nβ©. Let (nβ1)(kβt)β€k. Then
[TABLE]
if and only if there exist (kβt)-spaces Vijβ, for each 1β€i<jβ€n, and (kβ(nβ1)(kβt))-spaces Uiβ, for each 1β€iβ€n, such that the following conditions hold:
-
For each 1β€i<jβ€n, Vijβ=Οiββ©Οjβ.
2. 2.
For each 1β€iβ€n, Οiβ=β¨Uiβ,Οiββ©Οjββ£iξ =jβ©.
3. 3.
The dimension of the span of all the spaces above is maximal, i.e.,
[TABLE]
Proof.
First note that to find the dimension of the space in the third condition, we can just sum up the dimensions of the spaces Uiβ and Vljβ. This gives us the formula in the third condition:
[TABLE]
For the first part of the proof, assume that all the enlisted conditions hold for C. Then we want to prove that dimS+dimI=nk. The third condition implies that the span of all spaces Vijβ, with 1β€i<jβ€n, must be maximal. So to find the dimension of I, we just need to sum up the dimensions of the spaces Vijβ:
[TABLE]
On the other hand, the first two conditions imply that S=β¨Ο1β,β¦,Οnββ©=β¨Uiβ,Vljββ£iβ{1,β¦,n}Β andΒ 1β€l<jβ€nβ©. The third condition immediately implies:
[TABLE]
Combining (3) and (4), we get that dimS+dimI=nk.
This completes the first part of the proof.
The remainder of the proof is again by induction on the size n of C. For the induction base, assume n=2. Then it is not hard to see that the enlisted conditions must hold.
Now assume that the theorem is true for any (k,kβt)-SCID with size nβ1 and that we have a (k,kβt)-SCID C={Ο1β,β¦,Οnβ} of size n such that dimS+dimI=nk. Now define Cβ²:={Ο1β,β¦,Οnβ1β}, Sβ²:=β¨Ο1β,β¦,Οnβ1ββ© and Iβ²:=β¨Οiββ©Οjββ£1β€i<jβ€nβ1β©. Then, by Lemma 1.1, Cβ² is a (k,kβt)-SCID.
Note that we only can have dimS+dimI maximal, if equality holds in (1) and (2) in every induction step of the proof of Theorem 2.1. Adding up these two equalities, we find that dimS+dimI=dimSβ²+dimIβ²+k, implying that also dimSβ²+dimIβ²=(nβ1)k must be maximal. Applying the induction hypothesis on Cβ² now gives us the following:
-
There exist (kβt)-spaces Vijβ, for each 1β€i<jβ€nβ1, such that Vijβ=Οiββ©Οjβ.
2. 2.
There exist (kβ(nβ2)(kβt))-spaces Uiβ²β, for each 1β€iβ€nβ1, such that Οiβ=β¨Uiβ²β,Οiββ©Οjββ£iξ =jβ©.
3. 3.
The span of the spaces above has maximal dimension.
Define A:=β¨Ο1ββ©Οnβ,Ο2ββ©Οnβ,β¦,Οnβ1ββ©Οnββ©, and Ξ΄β₯0 such that dimA=kβt+Ξ΄.
As remarked before, equality must hold in (1) in the proof of Theorem 2.1:
[TABLE]
hence, dim(Aβ©Iβ²)=0. Now define Vinβ:=Οiββ©Οnβ, for all 1β€i<n. Then dim(Aβ©Iβ²)=0 implies that VinββUiβ²β, so the third property implies that the span β¨Vijββ£1β€i<jβ€nβ© has maximal dimension. Analogously as in the first part of the proof, we now find that dimI=2n(nβ1)β(kβt).
Now choose (kβ(nβ1)(kβt))-spaces UiββUiβ²β, for 1β€i<n, such that Uiβ²β=β¨Uiβ,Vinββ©. Also choose a (kβ(nβ1)(kβt))-space Unβ such that Οnβ=β¨Vinβ,Unββ£1β€i<nβ©. For these choices of Vijβ, with 1β€i<jβ€n, and Uiβ, with 1β€iβ€n, the first two conditions are fulfilled.
Note that S=β¨Uiβ,Vljββ£iβ{1,β¦,n}Β andΒ 1β€l<jβ€nβ©, while for the dimension of S we have:
[TABLE]
which is exactly the sum of the dimensions of the spaces Vijβ, with 1β€i<jβ€n and the spaces Uiβ, with 1β€iβ€n. This is precisely what the third condition states.
β
Note that the condition (nβ1)(kβt)β€k is necessary for the construction in Theorem 2.2 to work. Moreover, it follows from the proof that if this condition doesnβt hold, then there exists no (k,kβt)-SCID with dimS+dimI=nk. This means that the bound given in Theorem 2.1 is sharp if and only if the condition (nβ1)(kβt)β€k holds.
The objective now is to gain more insight in what happens if the condition (nβ1)(kβt)β€k doesnβt hold. For this purpose, it is useful to consider the case where n=3.
In the case 2(kβt)>k, the bound from Theorem 2.1, although valid, cannot be sharp. Lemma 2.3 provides an upper bound that is also valid for all values of k and t, but which is in fact an improvement in the case 2(kβt)>k.
Lemma 2.3**.**
Let C={Ο1β,Ο2β,Ο3β} be a (k,kβt)-SCID. Define S:=β¨Ο1β,Ο2β,Ο3ββ© and I:=β¨Ο1ββ©Ο2β,Ο1ββ©Ο3β,Ο2ββ©Ο3ββ©. Then dimS+dimIβ€2(k+t).
Proof.
Define Ο΅β₯0, such that dim(Ο1ββ©Ο2ββ©Ο3β)=kβtβΟ΅.
Then:
[TABLE]
such that dimS+dimIβ€k+t+tβΟ΅+kβt+2Ο΅=2k+t+Ο΅. Note however that Ο΅β€kβ(kβt)=t, such that dimS+dimIβ€2k+2t.
β
Note that the equality dimS+dimI=2(k+t) only occurs when Ο΅=t. In that case, we have Ο1β=β¨Ο1ββ©Ο2β,Ο1ββ©Ο3ββ©, Ο2β=β¨Ο1ββ©Ο2β,Ο2ββ©Ο3ββ© and Ο3β=β¨Ο2ββ©Ο3β,Ο1ββ©Ο3ββ©.
Inspired by this lemma, we prove a new bound on dimS+dimI that is valid for all values of nβ₯3, k and t.
Theorem 2.4**.**
Let C={Ο1β,β¦,Οnβ} be a (k,kβt)-SCID, with size nβ₯3. Define S:=β¨Ο1β,β¦,Οnββ© and I:=β¨Οiββ©Οjββ£1β€i<jβ€nβ©. Then:
[TABLE]
Proof.
Define Sβ²:=β¨Ο1β,β¦,Οnβ1ββ© and Iβ²:=β¨Οiββ©Οjββ£1β€i<jβ€nβ1β©. Then, by Theorem 2.1, we know that:
[TABLE]
Now define A:=β¨Ο1ββ©Οnβ,β¦,Οnβ1ββ©Οnββ© and let Ξ΄β₯0 be such that dimA=kβt+Ξ΄.
Note that I=β¨Iβ²,Aβ©, such that:
[TABLE]
Define B:=β¨Ο1ββ©Ο2β,Ο1ββ©Ο3β,β¦,Ο1ββ©Οnβ1ββ©, the space spanned by all the intersections with Ο1β, except for Ο1ββ©Οnβ. Then Ο1ββ©Ο2ββB, such that dimBβ₯kβt. Moreover we have β¨Ο1ββ©Οnβ,Bβ©βΟ1β, such that:
dimΟ1ββ₯dim(Ο1ββ©Οnβ)+dimBβdim(Ο1ββ©Οnββ©B)
β
kβ₯kβt+kβtβdim(Ο1ββ©Οnββ©B)
β
dim(Ο1ββ©Οnββ©B)β₯kβ2t.
Since Ο1ββ©Οnββ©BβAβ©Iβ², it follows that dim(Aβ©Iβ²)β₯kβ2t. Combining this with (6) we get:
[TABLE]
On the other hand, S=β¨Sβ²,Οnββ© and AβSβ²β©Οnβ, such that:
[TABLE]
Combining (7) and (8) with (5), we find:
[TABLE]
β
Comparing this new bound to the bound given in Theorem 2.1, we can now distinguish three cases:
In this case, nk<(nβ1)k+2t, so the bound from Theorem 2.1 is the best bound we have. By Theorem 2.2, this bound is sharp if and only if the inequality (nβ1)(kβt)β€k holds.
Now we have nk=(nβ1)k+2t, such that the new bound is the same as the bound given in Theorem 2.1. Note that in this case (nβ1)(kβt)β€kβnβ€3, such that the bound is only sharp for nβ€3. For n>3, we will show in Theorem 2.5 that dimS+dimIβ€nkβ(nβ3). We donβt know whether this bound is sharp.
Then (nβ1)k+2t<nk, such that the new bound is an improvement compared to Theorem 2.1. In Theorem 2.5, we will show that dimS+dimIβ€2k+2(nβ2)tβ(nβ3). Note that, given k>2t, we have for nβ₯3:
[TABLE]
such that Theorem 2.5 indeed gives us a better bound for nβ₯3.
Theorem 2.5**.**
For nβ₯3, let C={Ο1β,β¦,Οnβ} be a (k,kβt)-SCID, with kβ₯2t. Define S:=β¨Ο1β,β¦,Οnββ© and I:=β¨Οiββ©Οjββ£1β€i<jβ€nβ©. Then:
[TABLE]
Proof.
The proof is by induction on n.
For the induction base, consider n=3. If k>2t, it follows from Lemma 2.3 that dimI+dimSβ€2k+2t, agreeing with the theorem. If k=2t, then we have by Theorem 2.1 that dimS+dimIβ€3k=2k+2t.
Now assume that the theorem is true for (k,kβt)-SCIDs with nβ1 elements. Then it is in particular true for Cβ²:={Ο1β,β¦,Οnβ1β}. Define Sβ²:=β¨Ο1β,β¦,Οnβ1ββ© and Iβ²:=β¨Οiββ©Οjββ£1β€i<jβ€nβ1β©. Then the induction hypothesis implies:
[TABLE]
Define A:=β¨Ο1ββ©Οnβ,β¦,Οnβ1ββ©Οnββ© to be the space spanned by the intersections with the space Οnβ. Then dimA=kβt+Ξ΄, for a certain value Ξ΄β₯0. Note that S=β¨Sβ²,Οnββ© and that AβΟnββ©Sβ², thus we have:
[TABLE]
We can now repeat the same argument as in the previous proof, to find that dim(Aβ©Iβ²)β₯kβ2t. We distinguish between two cases:
Case 1: dim(Aβ©Iβ²)=kβ2t.
For any i,j, with 1β€i<jβ€nβ1, we have β¨Οiββ©Οnβ,Οjββ©Οnββ©βΟnβ, implying:
[TABLE]
We find dim(Οiββ©Οjββ©Οnβ)β₯kβ2t. Since dim(Aβ©Iβ²)=kβ2t and Οiββ©Οjββ©ΟnββAβ©Iβ², we have that Οiββ©Οjββ©Οnβ=Aβ©Iβ². Since this argument is independent from the choices of i and j, it follows that all intersections Οiββ©Οjββ©Οnβ must coincide, for 1β€i<jβ€nβ1. Hence, the intersections Οiββ©Οnβ form a (kβt,kβ2t)-sunflower inside Οnβ.
Now let X be a t-dimensional space skew to Οnβ, such that Ο1ββ©Ο2β=β¨Ο1ββ©Ο2ββ©Οnβ,Xβ©. Then, Ο1β=β¨Ο1ββ©Οnβ,Xβ©ββ¨Οnβ,Xβ© and Οnβββ¨Οnβ,Xβ©. For any i, with 1<i<n, we have Οiββ©Ο1ββΟiβ, Οiββ©ΟnββΟiβ and
[TABLE]
This implies that Οiβ=β¨Οiββ©Ο1β,Οiββ©Οnββ©ββ¨Ο1β,Οnββ©ββ¨Οnβ,Xβ©. Hence, Sββ¨Οnβ,Xβ© and Iββ¨Οnβ,Xβ©.
We have that dimβ¨Οnβ,Xβ©=k+t, which implies that dimIβ€k+t and dimSβ€k+t, such that dimS+dimIβ€2(k+t). This bound is lower than the one stated in the theorem.
Case 2: dim(Aβ©Iβ²)>kβ2t.
We have that I=β¨Iβ²,Aβ©, such that
[TABLE]
Combining (10) and (β’ β£ 2) with (9) we get:
[TABLE]
β
We conclude this section with a summary of the bounds for different values of n, k and t, given by Table 1.
3 Spectrum results
In this section we construct examples of SCIDs for several values of dimS+dimI. In the second subsection, weβll assume that the condition (nβ1)(kβt)β€k holds, and adapt the construction from Theorem 2.2 to construct new SCIDs with dimS+dimI=nkβΟ΅. Then later in the third subsection, we will drop the assumption (nβ1)(kβt)β€k and use field reduction to construct sunflowers, which are particular examples of SCIDs, for even smaller values of dimS+dimI. The concept of field reduction is explained in the first subsection. We finish this section with a summary of the spectrum results we obtained.
3.1 Field reduction
Field reduction is a powerful tool in finite geometry. The method is described for projective spaces in [11] and for projective spaces and polar spaces in [7]. For our purposes however, we will consider field reduction in vector spaces.
The idea relies on the fact that Fqtβ is a t-dimensional vector space over Fqβ. Hence, all 1-dimensional subspaces of a vector space V(n,qt) correspond to t-dimensional subspaces of the vector space V(nt,q). Moreover, the set of all 1-dimensional spaces of V(n,qt) corresponds to a t-spread in V(nt,q). This spread is often called a Desarguesian spread.
Note that a d-dimensional subspace in V(n,qt) corresponds to a dt-dimensional subspace in V(nt,q). Hence, we have the following lemma:
Lemma 3.1**.**
Using field reduction, a set of 1-dimensional subspaces in V(n,qt) spanning a d-dimensional space corresponds to a partial t-spread in V(nt,q) spanning a dt-dimensional space.
3.2 Spectrum result on SCIDs
In the proof of Theorem 2.2, we constructed a SCID such that both dimI and dimS were maximal. This way the sum dimS+dimI was maximal as well. In this section we want to construct SCIDs with smaller values for this sum. In order to do this, we adapt the construction from Theorem 2.2 in such a way that dimI decreases, while dimS stays as large as possible.
The idea behind the proof of Theorem 3.2 is that instead of having all pairwise intersections span a space of maximal dimension, we now demand that there is some overlap between three spaces of the SCID. This causes dimI to decrease. On the other hand, we want dimS to be as large as possible under this requirement. So apart from the overlap, we need all spaces of the SCID to span maximal dimension.
Theorem 3.2**.**
If (nβ1)(kβt)β€k and 0β€Ο΅β€kβt, then there exists a (k,kβt)-SCID {Ο1β,β¦,Οnβ}, such that
[TABLE]
with S:=β¨Ο1β,β¦,Οnββ© and I:=β¨Οiββ©Οjββ£iξ =jβ©.
Proof.
If Ο΅=0, then a construction is given by Theorem 2.2.
For Ο΅>0, consider a (k,kβt)-SCID C={Ο1β,β¦,Οnβ} constructed as in the proof of Theorem 2.2. We will slightly adapt this SCID in order to construct a new SCID Cβ²={Ο1β²β,β¦,Οnβ²β}. In this new SCID, there will be an Ο΅-dimensional overlap between the three spaces Ο1β²β, Ο2β²β and Οnβ²β.
Consider an Ο΅-dimensional subspace EβΟ1ββ©Οnβ and two (kβtβΟ΅)-dimensional subspaces D1ββΟ1ββ©Ο2β and D2ββΟ2ββ©Οnβ. From the conditions in Theorem 2.2, it follows that β¨E,D1β,D2ββ© has maximal dimension. Weβll choose our spaces from Cβ² such that the space E is the overlap between Ο1β²β, Ο2β²β and Οnβ²β, and such that Ο1β²ββ©Ο2β²β=β¨E,D1ββ© and Ο2β²ββ©Οnβ²β=β¨E,D2ββ©.
By shifting the intersections like this, we loose Ο΅ dimensions from each of the three spaces Ο1β, Ο2β and Οnβ. To compensate for this loss, choose Ο΅-dimensional spaces P1β, P2β and Pnβ, such that these spaces span maximal dimension together with the elements of C, i.e., dimβ¨P1β,P2β,Pnβ,Οiββ£1β€iβ€nβ© is maximal.
Remember that by Theorem 2.2, there exist (kβ(nβ1)(kβt))-dimensional spaces U1β,β¦,Unβ, such that for each 1β€iβ€n, the space Uiβ is skew to β¨Ο1β,β¦,Οiβ1β,Οi+1β,β¦,Οnββ© and such that Οiβ=β¨Uiβ,Οiββ©Οjββ£iξ =jβ©. Now we have all components to define the spaces of Cβ²:
[TABLE]
Now we first want to show that this defines in fact a (k,kβt)-SCID. For the dimensions of the spaces Ο1β²β,β¦,Οnβ²β, note that we can just sum up the dimensions of the spaces in their definitions above. This follows directly from the third condition in Theorem 2.2. We now find:
[TABLE]
Moreover, for the intersections we have that Οiβ²ββ©Οjβ²β=Οiββ©Οjβ, for 1β€i<jβ€n, except for Ο1β²ββ©Ο2β²β and Ο2β²ββ©Οnβ²β. For these intersections we have that Ο1β²ββ©Ο2β²β=β¨D1β,Eβ© and Ο2β²ββ©Οnβ²β=β¨D2β,Eβ©. Note that EβΟ1ββ©Οnβ. Hence all pairwise intersections of the spaces Ο1β²β,β¦,Οnβ²β have dimension kβt. This implies that Cβ²={Ο1β²β,β¦,Οnβ²β} is indeed a (k,kβt)-SCID.
Now define S:=β¨Ο1β²β,β¦,Οnβ²ββ© and I:=β¨Οiβ²ββ©Οjβ²ββ£1β€i<jβ€nβ©. Note that, since EβΟ1β²ββ©Οnβ²β:
[TABLE]
where (i,j)β{1,β¦,n}2β{(1,2),(2,n)}. By the definitions above and the third condition of Theorem 2.2, we can sum up the dimensions of these spaces to find the dimension of I:
[TABLE]
On the other hand, note that:
[TABLE]
where 1β€lβ€n and (i,j)β{1,β¦,n}2β{(1,2),(2,n)}. Note again that EβΟ1β²ββ©Οnβ²β. Again by the third condition of Theorem 2.2 and by the way we defined these spaces, we can find the dimension of S by summing the dimensions:
[TABLE]
Combining (3.2) and (3.2), we get:
[TABLE]
We can conclude that Cβ² is a (k,kβt)-SCID fulfilling the condition of the theorem.
β
The idea of this proof can be generalized to construct SCIDs with lower values of the sum dimS+dimI. In the first part of the proof of Theorem 3.3, we let intersections coincide instead of just having some overlap. This again causes dimI to decrease. Meanwhile we keep dimS as large as possible by choosing spaces that span maximal dimension.
In the second part of the proof, we adapt the construction from the first part by using a similar technique to Theorem 3.2.
Theorem 3.3**.**
If (nβ1)(kβt)β€k, 0β€Ο΅β€kβt and 2β€Ξ·β€nβ1, then there exists a (k,kβt)-SCID {Ο1β,β¦,Οnβ} such that:
[TABLE]
with S:=β¨Ο1β,β¦,Οnββ© and I:=β¨Οiββ©Οjββ£iξ =jβ©.
Proof.
For Ξ·=2, this is exactly Theorem 3.2. So assume Ξ·>2. We distinguish between two cases, based on the value of Ο΅.
Case 1: Ο΅=0
Let C be a (k,kβt)-SCID as constructed in Theorem 2.2. Just like in the previous proof, we will make adaptations to C in order to obtain a new (k,kβt)-SCID Cβ²={Ο1β²β,β¦,Οnβ²β} fulfilling the conditions of the theorem. For this new SCID, there will be a (kβt)-dimensional subspace that all spaces Ο1β²β,β¦,ΟΞ·β1β²β and Οnβ²β have in common.
Now define D:=Ο1ββ©Οnβ, this will be the common subspace. But if we shift the elements of the SCID in such a way that all spaces Ο1β²β,β¦,ΟΞ·β1β²β and Οnβ²β have D in common, then we loose (kβt)(Ξ·β2) dimensions in each of these spaces. To compensate this, choose (kβt)(Ξ·β2)-dimensional spaces P1β,β¦,PΞ·β1β and Pnβ, such that these spaces span maximal dimension with the elements of C, i.e., dimβ¨P1β,β¦,PΞ·β1β,Pnβ,Οiββ£1β€iβ€nβ© is maximal.
Note that, by Theorem 2.2, there exist (kβ(nβ1)(kβt))-dimensional spaces U1β,β¦,Unβ, such that for each 1β€iβ€n, the space Uiβ is skew to β¨Ο1β,β¦,Οiβ1β,Οi+1β,β¦,Οnββ© and such that Οiβ=β¨Uiβ,Οiββ©Οjββ£iξ =jβ©. Now we have all components to define the spaces of Cβ²:
[TABLE]
We now want to show that this indeed defines a (k,kβt)-SCID. To find the dimensions of the spaces Ο1β²β,β¦,Οnβ²β, note that we can simply sum up the dimensions of the spaces in their definitions above. This follows from the third condition in Theorem 2.2. We now find:
[TABLE]
For the pairwise intersections, we have Οiβ²ββ©Οjβ²β=Οiββ©Οjβ, if 1β€iβ€n and Ξ·β€j<n. All other pairwise intersections are equal to the space D. We can conclude that all the pairwise intersections of the spaces {Ο1β²β,β¦,Οnβ²β} have dimension kβt, implying Cβ²:={Ο1β²β,β¦,Οnβ²β} is a (k,kβt)-SCID.
Now define S:=β¨Ο1β²β,β¦,Οnβ²ββ© and I:=β¨Οiβ²ββ©Οjβ²ββ£1β€i<jβ€nβ©. Note that
[TABLE]
where we can add the dimensions of the intersections Οiβ²ββ©Οjβ²β and D, to find dimI. Note that the number of intersections Οiβ²ββ©Οjβ²β occurring in this expression is
[TABLE]
From this follows the dimension of I:
[TABLE]
where the first value kβt comes from dimD.
On the other hand, for S we have:
[TABLE]
By construction, we can find the dimension of S by summing up all dimensions of the spaces occurring in the expression above. Hence, we find:
[TABLE]
Note that 2Ξ·(nβΞ·)+(nβΞ·)(nβΞ·β1)=n(nβ1)βΞ·(Ξ·β1).
Combining this with (14) and (3.2), we find:
[TABLE]
Hence, Cβ² is a (k,kβt)-SCID fulfilling the condition of the theorem.
Case 2: Ο΅>0
Let Cβ²={Ο1β²β,β¦,Οnβ²β} be a (k,kβt)-SCID as constructed in the previous case for Ο΅=0. Let the spaces D, Piβ and Ujβ, for iβ{1,β¦,Ξ·β1,n} and jβ{1,β¦,n}, be as defined in the first case. We will again adapt Cβ² to construct a (k,kβt)-SCID Cβ²β²={Ο1β²β²β,β¦,Οnβ²β²β} meeting the desired conditions. For this, we generalize the technique used in the proof of Theorem 3.2.
Let EβD=Ο1β²ββ©Οnβ²β be an Ο΅-dimensional subspace, this will be the overlap between the spaces Ο1β²β²β,β¦,ΟΞ·β²β²β and Οnβ²β²β. Next, consider (kβtβΟ΅)-dimensional subspaces D1ββΟ1β²ββ©ΟΞ·β²β,β¦,DΞ·β1ββΟΞ·β1β²ββ©ΟΞ·β²β and DnββΟΞ·β²ββ©Οnβ²β. We will choose the elements of Cβ²β² in such a way that Οiβ²β²ββ©ΟΞ·β²β²β=β¨Diβ,Eβ©, for iβ{1,β¦,Ξ·β1,n}.
Shifting the spaces like this again causes a loss of dimensions. Note that we loose (Ξ·β1)Ο΅ dimensions from ΟΞ·β²β. To compensate, choose an (Ξ·β1)Ο΅-dimensional space Y, such that Y spans maximal dimension together with the spaces of C, i.e., dimβ¨Y,Οiββ£1β€iβ€nβ© is maximal.
From each of the first Ξ·β1 spaces and the nth space we loose Ο΅ dimensions. To compensate, choose Ο΅-dimensional spaces X1β,β¦,XΞ·β1β and Xnβ, such that these spaces span maximal dimension together with Y and the spaces of Cβ². I.e. dimβ¨X1β,β¦,XΞ·β1β,Xnβ,Y,Οiβ²ββ£1β€iβ€nβ© is maximal.
Now we have everything we need to define Cβ²β²={Ο1β²β²β,β¦,Οnβ²β²β}:
[TABLE]
By the way we defined the spaces in the definitions above, we can just sum up the dimensions of the subspaces to find the dimensions of the spaces Οiβ²β²β:
[TABLE]
For the pairwise intersections we have Οiβ²β²ββ©Οjβ²β²β=Οiβ²ββ©Οjβ²β, as long as i and j are different from Ξ·. For Ξ·<i<n, we have ΟΞ·β²β²ββ©Οiβ²β²β=ΟΞ·β²ββ©Οiβ²β. For 1β€i<Ξ·, Οiβ²β²ββ©ΟΞ·β²β²β=β¨E,Diββ© and similarly we have ΟΞ·β²β²ββ©Οnβ²β²β=β¨E,Dnββ©. We can conclude that all the pairwise intersections of the spaces {Ο1β²β²β,β¦,Οnβ²β²β} have dimension kβt, implying Cβ²β²:={Ο1β²β²β,β¦,Οnβ²β²β} is indeed a (k,kβt)-SCID.
Now define S:=β¨Ο1β²β²β,β¦,Οnβ²β²ββ© and I:=β¨Οiβ²β²ββ©Οjβ²β²ββ£1β€i<jβ€nβ©. Note that, since EβD:
[TABLE]
where 1β€iβ€n, Ξ·<j<n and iξ =j. Note that the number of different intersections Οiβ²β²ββ©Οjβ²β²β occurring in the expression above is:
[TABLE]
By construction, we can again sum the dimensions of the spaces occurring in the expression above to find the dimension of I:
[TABLE]
On the other hand, note for S that:
[TABLE]
where 1β€iβ€n, Ξ·<j<n and iξ =j. Again, the construction allows us to calculate the sum of the dimensions of all the spaces in the expression above to find the dimension of S. We now have:
[TABLE]
Combining (3.2) and (3.2) and noting that
[TABLE]
we find:
[TABLE]
This shows that Cβ²β² meets the desired conditions, finishing the proof.
β
As long as the condition (nβ1)(kβt)β€k holds, we have established examples of (k,kβt)-SCIDs with dimS+dimI=N, for any integer Nβ[nkβ(nβ2)(kβt),nk].
3.3 Spectrum result on sunflowers
What we actually did in the constructions of the previous section, was making dimI smaller while keeping dimS as large as possible. This method eventually gives rise to a maximal (k,kβt)-sunflower, for the case dimS+dimI=nkβ(nβ2)(kβt)=2k+(nβ2)t.
Note that for any sunflower we have dimI=kβt, which is the smallest possible dimension for I. To construct SCIDs with dimS+dimIβ€2k+(nβ2)t, it is not possible to further reduce dimI. But since weβre dealing with a maximal sunflower, we can reduce dimS. In that case we still have a sunflower, which is an example of a SCID.
From now on, we drop the condition (nβ1)(kβt)β€k. The essence of this section lies in field reduction and the following lemma:
Lemma 3.4**.**
The existence of a (k,kβt)-sunflower spanning dimension d is equivalent to the existence of a partial t-spread in a (dβk+t)-dimensional space, spanning that (dβk+t)-dimensional space.
Proof.
Let S be the space spanned by the elements of the sunflower and let C be its center. Then dimS=d, dimC=kβt, and all elements of the sunflower have dimension k.
Now consider the quotient space S/C. The elements of the sunflower all contain the center C, so in the quotient space they have dimension kβ(kβt)=t. Since all elements of the sunflower have precisely C as their pairwise intersections, their quotient equivalents must intersect trivially. So they must form a partial t-spread in S/C.
Moreover, since the elements of the sunflower span the space S, their quotient equivalents must span S/C, which has dimension dβ(kβt)=dβk+t.
β
Remember that we are working in a vector space V over the field Fqβ, otherwise we cannot apply field reduction.
Theorem 3.5**.**
If 1β€Ξ·β€nβ2 and nβ€qtβ1qt(nβΞ·)β1β, then there exists a (k,kβt)-SCID {Ο1β,β¦,Οnβ} such that:
[TABLE]
with S:=β¨Ο1β,β¦,Οnββ© and I:=β¨Οiββ©Οjββ£iξ =jβ©.
Proof.
We will construct a sunflower C meeting the conditions. Note that for a sunflower, dimI=kβt. To have C fulfill the equality in the theorem, we must have that dimS=k+(nβ1)tβΞ·t.
By Lemma 3.4, the existence of such a sunflower is equivalent to the existence of a partial t-spread in an (nβΞ·)t-dimensional vector space V((nβΞ·)t,q), spanning that space. We can now use field reduction to guarantee the existence of C.
Consider the vector space V(nβΞ·,qt). Choose n lines, such that the last nβΞ· lines span the complete space V(nβΞ·,qt). Since nβΞ·<nβ€qtβ1qt(nβΞ·)β1β, where qtβ1qt(nβΞ·)β1β is the number of lines in V(nβΞ·,qt), this is always possible. By Lemma 3.1, this set of n lines in V(nβΞ·,qt) corresponds to a partial t-spread in V((nβΞ·)t,q), spanning the whole space.
β
Note that qtβ1qt(nβΞ·)β1β is the cardinality of a t-spread in an (nβΞ·)t-dimensional vector space over Fqβ. By reversing the arguments used in the previous proof, it is clear that there cannot exist a (k,kβt)-sunflower with dimS+dimI=2k+(nβ2)tβΞ·t if n>qtβ1qt(nβΞ·)β1β. However, this does not exclude the existence of an example of a (k,kβt)-SCID with these parameters.
Theorem 3.6**.**
If 1β€Ξ·β€nβ2, 0β€Ο΅<t, and nβ€qtβ1qt(nβΞ·)β1β, then there exists a (k,kβt)-SCID {Ο1β,β¦,Οnβ} such that:
[TABLE]
with S:=β¨Ο1β,β¦,Οnββ© and I:=β¨Οiββ©Οjββ£iξ =jβ©.
Proof.
For Ο΅=0, this is exactly the previous theorem.
For Ο΅>0, we will prove the existence of a (k,kβt)-sunflower meeting the conditions, in a similar way as in Theorem 3.5. Choose n lines such that the last nβΞ· lines span the complete space V(nβΞ·,qt). Similarly to the previous proof, we have by Lemma 3.1 that this set of n lines in V(nβΞ·,qt) corresponds to a partial t-spread {Ο1β,β¦,Οnβ} in V((nβΞ·)t,q), spanning this whole space. Now embed this space V=V((nβΞ·)t,q) in a vector space Vβ²=V((nβΞ·)t+Ο΅,q). Choose an Ο΅-dimensional space E in Vβ², intersecting trivially with V. Then β¨V,Eβ©=Vβ². Consider a (tβΟ΅)-dimensional subspace U of Ο1β. Now replace Ο1β by Ο1β²β=β¨U,Eβ©. Then {Ο1β²β,Ο2β,β¦,Οnβ} is a partial t-spread, spanning Vβ². By Lemma 3.4, there exists a sunflower meeting the conditions.
β
We have now proved that there exists a (k,kβt)-SCID (more precisely, a (k,kβt)-sunflower) with dimS+dimI=N, for any integer Nβ[2k,2k+(nβ2)t], as long as the condition nβ€qtβ1qt(nβΞ·)β1β holds. Note that a (k,kβt)-SCID with dimS+dimI<2k cannot exist.
3.4 Summary
There exists a (k,kβt)-SCID with n elements and with dimS+dimI=N,
for any integer Nβ[2k+(nβ2)t,nk], if (nβ1)(kβt)β€k.
for any integer Nβ[2k,2k+(nβ2)t], if nβ€qtβ1qt(nβΞ·)β1β.