Vertex properties of maximum scattered linear sets of $\mathrm{PG}(1,q^n)$
Corrado Zanella, Ferdinando Zullo

TL;DR
This paper studies the geometric and algebraic properties of maximum scattered linear sets in projective lines over finite fields, providing new examples and characterizations that relate to MRD-codes.
Contribution
It characterizes maximum scattered linear sets via vertex properties and constructs new examples, linking geometric configurations to coding theory.
Findings
Characterization of maximum scattered linear sets by vertex properties.
Construction of new scattered linear sets in PG(1,q^6).
New MRD-code examples with specific algebraic properties.
Abstract
In this paper we investigate the geometric properties of the configuration consisting of a -subspace and a canonical subgeometry in , with . The idea motivating is that such properties are reflected in the algebraic structure of the linear set which is projection of from the vertex . In particular we deal with the maximum scattered linear sets of the line found by Lunardon and Polverino and recently generalized by Sheekey. Our aim is to characterize this family by means of the properties of the vertex of the projection as done by Csajb\'ok and the first author of this paper for linear sets of pseudoregulus type. With reference to such properties, we construct new examples of scattered linear sets in , yielding also to new examples of MRD-codes in $\mathbb…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Vertex properties of maximum scattered linear sets of
Corrado Zanella and Ferdinando Zullo
The research was supported by the Italian National Group for Algebraic and Geometric Structures and their Applications (GNSAGA
- INdAM).
Abstract
In this paper we investigate the geometric properties of the configuration consisting of a subspace and a canonical subgeometry in , with . The idea motivating is that such properties are reflected in the algebraic structure of the linear set which is projection of from the vertex . In particular we deal with the maximum scattered linear sets of the line found by Lunardon and Polverino in [27] and recently generalized by Sheekey in [37]. Our aim is to characterize this family by means of the properties of the vertex of the projection as done by Csajbók and the first author of this paper for linear sets of pseudoregulus type. With reference to such properties, we construct new examples of scattered linear sets in , yielding also to new examples of MRD-codes in with left idealiser isomorphic to .
AMS subject classification: 51E20, 05B25, 51E22
Keywords: Linear set, linearized polynomial, -polynomial, finite projective line, subgeometry, scattered linear set
1 Introduction
Let , where is a vector space of dimension over . A point set of is said to be an -linear set of of rank if it is defined by the non-zero vectors of a -dimensional -vector subspace of , i.e.
[TABLE]
Two linear sets and of are said to be -equivalent if there is an element in such that . It may happen that two –linear sets and of are -equivalent even if the -vector subspaces and are not in the same orbit of (see [12] and [5] for further details).
Lunardon and Polverino in [28] (see also [26]) show that every linear set is a projection of a canonical subgeometry, where a canonical subgeometry in is a linear set of rank such that (111Angle brackets without the indication of a field will denote the projective span of a set of points in a projective space.). In particular, by [28, Theorems 1 and 2] (adapted to the projective line case), for each -linear set of the projective line of rank there exist a canonical subgeometry of , and an -subspace of disjoint from and from such that
[TABLE]
We call and the vertex (or center) and the axis of the projection, respectively.
In this paper we focus on maximum scattered -linear sets of , that is, -linear sets of rank in of size . In this case, we also say that the related -subspace is maximum scattered. Recall that the weight of a point is . A linear set is scattered if and only if each of its points has weight one.
If is not contained in the linear set of rank of (which we can always assume after a suitable projectivity), then for some linearized polynomial (or -polynomial) . In this case we will denote the associated linear set by .
The first example of maximum scattered -linear set, found by Blokhuis and Lavrauw in [2], is known as linear sets of pseudoregulus type and can be defined (see [25, Section 4]) as any linear set -equivalent to
[TABLE]
A characterization of the linear sets of pseudoregulus type has been given by Csajbók and Zanella in [13] as particular projections of a canonical subgeometry (see Theorem 1.1).
Theorem 1.1**.**
[13, Theorem 2.3]** Let be a canonical subgeometry of , , . Assume that and are an -subspace and a line of , respectively, such that . Then the following assertions are equivalent:
The set is a scattered -linear set of pseudoregulus type; 2. 2.
A generator exists of the subgroup of fixing pointwise, such that ; furthermore is not contained in the span of any hyperplane of ; 3. 3.
There exists a point and a generator of the subgroup of fixing pointwise, such that , and
[TABLE]
Few other families of maximum scattered linear sets of are known, see [7, 11]. We will deal with the only remaining family of maximum scattered linear sets existing for each value of . Such a family has been introduced by Lunardon and Polverino in [27] for and generalized by Sheekey in [37] and is defined as follows
[TABLE]
with , (222This condition implies .) and . More generally, we will call each linear set equivalent to a maximum scattered linear set of the form (1), with , of Lunardon-Polverino type (or shortly LP-type). For some values of , and , is a necessary condition for to be scattered, see Section 4. Up to our knowledge, no scattered is known satisfying .
Our aim is to prove characterizations of maximum scattered linear sets of LP-type in the spirit of the characterization of the linear sets of pseudoregulus type, cf. Theorem 1.1. As a consequence, we will construct new examples of maximum scattered linear sets in . As showed in [37, Sect. 5], this also yields to new examples of MRD-codes in with left idealiser isomorphic to [7, Proposition 6.1] (see also [9, 10, 38]), see last section for more details on the connections with MRD-codes.
We will work in the following framework. Let be the homogeneous coordinates of and let
[TABLE]
be a fixed canonical subgeometry of . The collineation of defined by fixes precisely the points of . Note that if is a collineation of such that , then , with .
2 Possible configurations of the vertex of the projection
Following [19, Section 3], we are able to describe the structure of the vertex of the projection, under certain assumptions regarding the dimension of the intersections with some of its conjugates w.r.t. a collineation of fixing the chosen subgeometry pointwise.
We start by recalling the following lemma.
Lemma 2.1**.**
[23, Lemma 3]** If is a nonempty projective subspace of dimension of fixed by , then meets in an -subspace of dimension . In particular, .
Since the vertex of the projection is disjoint from , we have that . We characterize the extremal case, i.e. when .
Theorem 2.2**.**
Let be a subspace of of dimension and such that . If , then there exists exactly one point in such that
[TABLE]
Furthermore, .
Proof.
The hypotheses imply . For , is a point . If , then , a contradiction. The remaining statements are trivial for this .
Now suppose that the assertion is true for -dimensional subspaces, and . Let denote by . Clearly, and . By our assumption, and also . Indeed,
[TABLE]
So,
[TABLE]
and since , otherwise by Lemma 2.1 we should have , we get . Therefore, there exists a point such that
[TABLE]
By induction hypothesis, . So,
[TABLE]
with .
Regarding the uniqueness, if for some point , then . By induction, this implies above defined, and .
Finally note that would imply and , a contradiction. ∎
The next result follows for from Theorem 2.2.
Theorem 2.3**.**
Let be a subspace of of dimension such that , and . Let be the least positive integer satisfying the condition
[TABLE]
Then there is a point satisfying
- (i)
, , , are independent points contained in ; 2. (ii)
.
If , then the point satisfying conditions (i) and (ii) is unique.
We will call the integer of the above statement the intersection number of w.r.t. and we will denote it by .
Proof.
Preliminary remarks. Since is a collineation and since , for any positive integer it holds
[TABLE]
This implies for any ; so, taking , , that is . Furthermore, if , then
[TABLE]
for otherwise . This implies
[TABLE]
Note that for then .
Existence of , by induction on . For , the assertion follows from Theorem 2.2. Assume then that Theorem 2.3 holds (except possibly for the uniqueness part) for , and . Let and . If , then the thesis is trivial.
Now suppose . Then it holds
[TABLE]
for , whereas
[TABLE]
By induction hypothesis there is a point satisfying
- (A)
are independent points; 2. (B)
; 3. (C)
.
Let . Then (B) implies that , , , are points contained in ; both (C) and (A) imply that they are independent. would imply
[TABLE]
contradicting .
Uniqueness of . By the previous considerations it follows that there exists at least one point such that , , , are independent points contained in . From (4) it follows that
[TABLE]
has dimension . Furthermore, , otherwise . It follows that satisfies the hypotheses of Theorem 2.2 and hence the point is unique. ∎
Remark 2.4**.**
It is clear that is as in the previous result, it follows that
[TABLE]
where .
Remark 2.5**.**
A similar idea to the intersection number for a vertex of a linear set has been presented in [34] (see also [19, 35]), where the authors used sequences of the dimensions of certain intersections as invariants for rank metric codes. See also the last section.
3 Characterization of linear sets of LP-type
3.1 Sufficient conditions
We are now ready to state sufficient conditions for a linear set to be of LP-type. In the following we denote by the norm over , for short.
Theorem 3.1**.**
In , , let be a subspace of dimension , a line, and a canonical subgeometry, such that . Assume is a scattered linear set of . If for some generator of the subgroup of fixing pointwise, then there exists a unique point such that
[TABLE]
Furthermore, if the line meets , then is of LP-type.
Proof.
An integer exists such that and , i.e. the -th component (333Starting to count from zero.) of is , where is seen modulo . By Theorem 2.3, there exist and in such that
[TABLE]
Denote by , then
[TABLE]
and may be chosen in . If , then, since , it follows that
[TABLE]
i.e. is contained in a subspace fixed by of dimension either or . In both the cases we get a contradiction because of . So, , and by [3, Proposition 3.1] there exists a linear collineation fixing such that . Clearly, satisfies the same hypothesis as , since and commute. For these reasons, we may assume that . In particular, it follows that the coordinates of are , where is the vector whose -th component is one and all the others are zero. And by hypothesis we may assume that . Hence we can choose as , so has equations , , and is defined by for .
Therefore,
[TABLE]
i.e. is of LP-type. ∎
Each linear set of LP-type (1) of , with and , can be realized as the projection of choosing and as follows
[TABLE]
Therefore, as a direct consequence of Theorem 3.1 we provide a characterization result of linear sets of LP-type.
Theorem 3.2**.**
Let be a canonical subgeometry of , and . Let be a scattered linear set in . Then is a linear set of LP-type if and only if
- (i)
there exists an -subspace of such that and ; 2. (ii)
there exists a generator of the subgroup of fixing pointwise, such that ; 3. (iii)
there exist a unique point and some point such that
[TABLE] 4. (iv)
the line meets .
3.2 Necessary conditions
Very recently, Csajbók, Marino and Polverino in [5] have investigated the equivalence problem between -linear sets of rank on the projective line . The idea is first to study the -orbits of the subspace defining the linear set and then to study the equivalence between two linear sets. More precisely, they give the following definition of -class (see [5, Definitions 2.5]) of an -linear set of a line.
Let be an linear set of of rank with maximum field of linearity (444The maximum field of linearity of an -linear set as if is the largest integer such that and is an -linear set.).
We say that is of -class if is the greatest integer such that there exist -subspaces of with for and there is no such that for each , .
If is of -class one, then is said to be simple, i.e. when the -orbit of completely determine the -orbit of . For , any linear set in is simple [5, Theorem 4.5].
The -class of a linear set is a projective invariant (by [5, Proposition 2.6]) and play a crucial role in the study of linear sets up to equivalences. Using these notions and by developing some new techniques, the authors in [6] prove that in each -linear set of rank and with maximum field of linearity is of -class at most , proving also that if is equivalent to then is -equivalent to either or to , where the non-degenerate symmetric bilinear form of over defined by
[TABLE]
for each is taken into account. Then the adjoint of the linearized polynomial with respect to the bilinear form is
[TABLE]
i.e.
[TABLE]
for each .
For linear sets of LP-type the following is known.
Theorem 3.3**.**
[6, 11]** A maximum scattered linear set of LP-type
[TABLE]
with and , is of -class less than or equal to for . Furthermore, is equivalent to if and only if is -equivalent to either or to .
Furthermore, in [5, 40], it has been shown that there are maximum scattered linear sets of LP-type of both -classes one and two.
For our purpose it is important to look to the -class in a more geometric way. The following result has been stated in [5, Section 5.2] as a consequence of [12, Theorems 6 & 7].
Theorem 3.4**.**
The -class of is the number of orbits in of -subspaces of containing a disjoint from and from such that is equivalent to .
As a consequence of Theorems 3.3 and 3.4, we have the following characterization for linear sets of LP-type.
Theorem 3.5**.**
Let be a maximum scattered linear set in with or . Then is a linear set of LP-type if and only if for each -subspace of such that , the following holds:
- (i)
there exists a generator of the subgroup of fixing pointwise, such that ; 2. (ii)
if is the unique point of such that
[TABLE]
then the line meets .
Proof.
Because of Theorem 3.3 and [5, Theorem 4.5], if or , then the two (possibly) not -equivalent representation for a linear set of LP-type (1) are
[TABLE]
Therefore, by Theorem 3.4 we have that all the possible vertices of the projections to obtain a linear set of LP-type satisfy the hypothesis of Theorem 3.2 and the assertion then follows. ∎
Remark 3.6**.**
Note that Theorem 3.5 guarantees that each vertex of the projection of a linear set of LP-type satisfies conditions and , whereas Theorem 3.2 asserts the existence of a vertex of the projection of a linear set of LP-type satisfying these conditions.
As we will see in Section 5, this result may turn out to be useful to construct new examples of maximum scattered linear sets in .
4 A purely geometric description for odd
The next lemma proves that, for odd, the only scattered linear sets of LP-type are exactly those described by Lunardon and Polverino in [27] and Sheekey [37].
Lemma 4.1**.**
Let , with , and let be odd. Then is scattered if and only if .
Proof.
We only have to prove that if , then cannot be scattered. The linear set is scattered if and only if in the following set of polynomials
[TABLE]
there are no polynomials with more than roots, for otherwise there would be a point of weight greater than one. Equivalently in the following set of polynomials
[TABLE]
there are no polynomials with more than roots. For any with , the polynomial
[TABLE]
has the same number of roots of . Note that since is odd, for any such that there is such that . Taking into account , this implies that for any polynomial of the form , with and , there are and such that (5) coincides with . This is a contradiction, since there exist polynomials of type , , with roots, e.g.
[TABLE]
where are -linearly independent. ∎
The previous lemma was already proved for in [14] and for in [1].
Theorem 4.2**.**
Let be a subspace of , odd, of dimension , and a canonical subgeometry of , such that . Assume that a generator exists of the subgroup of fixing pointwise, such that . Then there exists a point such that
[TABLE]
Furthermore assume that and meet in a point and . Let be the point such that the pair separates harmonically. Such is defined by the property that there are two representative vectors and for and , respectively, such that , . Under the assumptions above, the linear set , with a line disjoint from , is a maximum scattered linear set of LP-type if and only if
[TABLE]
Proof.
As in Theorem 3.1 it may be assumed that the coordinates of are , , otherwise. The coordinates of are , , otherwise. The span and are complementary subspaces of . So, is a hyperplane and its equation is . A point of belongs to if and only if , equivalent to
[TABLE]
Since is odd, is coprime with . This implies that an exists satisfying (7) if and only if , which is a contradiction because of Lemma 4.1. ∎
5 New constructions
In this section we will deal with the following family of linear sets
[TABLE]
We will show that for some choices of we may get new examples of maximum scattered linear sets. This family of linear sets can be obtained by projecting the canonical subgeometry from
[TABLE]
to
[TABLE]
Let us consider defined as
[TABLE]
and , which are the two generators of the subgroup of fixing pointwise. Then
[TABLE]
Therefore,
[TABLE]
Hence, and since is odd . Since and , we have that and . Therefore,
[TABLE]
This implies the non-equivalence of with the linear set of pseudoregulus type and also it cannot be of LP-type because of Theorem 3.5.
Computational results show that for the linear set is maximum scattered for . We show that for and it is also new. For we will prove in Proposition 5.5 that is equivalent to the linear set defined in [11].
5.1 Known examples of maximum scattered linear sets in
In order to decide whether the linear set is new, we describe the known maximum scattered linear sets in .
We start by listing the non-equivalent (under the action of ) maximum scattered subspaces of , i.e. subspaces defining maximum scattered linear sets.
Example 5.1**.**
, 555This condition implies ., see **[27, 29, 37]**; 3. 3.
, , satisfying further conditions on and , see **[7, Theorems 7.1 and 7.2]** 666Also here , otherwise it is not scattered.; 4. 4.
In order to simplify the notation, we will denote by and the -linear set defined by and , respectively. Therefore, as defined in (1). We will also use the following notation: .
In [11, Propositions 3.1, 4.1 & 5.5] the following result has been proved.
Lemma 5.2**.**
Let be one of the maximum scattered of listed before. Then a linear set of is -equivalent to if and only if is -equivalent either to or to . Furthermore, the linear set is simple.
The previous lemma includes results on linear sets of LP-type.
Remark 5.3**.**
If is an -subspace of type 1. or 2. above, then and are -equivalent. By Lemma 5.2, this holds also for -subspaces of type 3.
5.2 The linear set
Here we deal with the equivalence issue between the linear sets defined by Example 5.1 and the linear set . As already noted, we just have to check the equivalence with the linear sets and with defined by the subspaces 3. and 4. in Example 5.1, because of the construction of and Theorems 1.1 and 3.5.
Proposition 5.4**.**
The linear set is not -equivalent to .
Proof.
By Lemma 5.2, we have to check whether and are -equivalent, with . Suppose that there exist and an invertible matrix \left(\begin{array}[]{llrr}a&b\\ c&d\end{array}\right) such that for each there exists satisfying
[TABLE]
Equivalently, for each we have
[TABLE]
[TABLE]
This is a polynomial identity in and hence we have the following relations:
[TABLE]
From the second and the fifth equations, if then and so , which is not possible. So and then . Hence we have and , from which we get , which is not possible. Therefore, is not equivalent to . ∎
Proposition 5.5**.**
The linear set is -equivalent to , for odd and , if and only if there exist such that and either
[TABLE]
or
[TABLE]
In particular, when the linear set is -equivalent to .
Proof.
By Lemma 5.2 we have to check whether is equivalent either to or to . Suppose that there exist and an invertible matrix \left(\begin{array}[]{llrr}a&b\\ c&d\end{array}\right) such that for each there exists satisfying
[TABLE]
Equivalently, for each we have
[TABLE]
[TABLE]
[TABLE]
This is a polynomial identity in and hence we have the Equations (9).
Now, suppose that there exist and an invertible matrix \left(\begin{array}[]{llrr}a&b\\ c&d\end{array}\right) such that for each there exists satisfying
[TABLE]
As before, we get the Relations (10).
The second part follows from the fact that for , , and satisfy (9). ∎
Thanks to GAP computations we are able to prove that the Systems (9) and (10) have no solutions in and () for and . Therefore, we have the following result.
Corollary 5.6**.**
If , , , then is a maximum scattered linear set of not equivalent to any of those listed in Example 5.1.
Recall that is computationally proved to be scattered for , .
We conclude this section proposing the following conjecture.
Conjecture 5.7**.**
The linear set is a new maximum scattered linear set of for each such that and .
6 MRD-codes and scattered -subspaces
The most natural way to look to the connection between maximum scattered linear sets and MRD-codes is through the -subspaces defining such linear sets, i.e. maximum scattered -subspaces. We briefly recall some basic definitions and results on rank metric codes, that have been intensively investigated for their applications in cryptography, space-time coding and distributed storage and for their links with remarkable geometric and algebraic objects (see e.g. [1, 18, 15, 30, 36, 39]).
In 1978, Delsarte [16] introduced rank metric codes as follows. The set of matrices over is a rank metric -space with rank metric distance defined by
[TABLE]
for . A subset is called a rank metric code (or RM-code for short). The minimum distance of is
[TABLE]
We are interested in -linear RM-codes, i.e. for which is an -linear subspace of . We will say that such a code has parameters . In [16], Delsarte also showed that the parameters of these codes must fulfill a Singleton-like bound, i.e.
[TABLE]
When the equality holds, we call maximum rank distance (MRD for short) code.
From now on, we will only consider -linear RM-codes of , i.e. those which can be identified with -subspaces of . Since is isomorphic to the ring of -polynomials over modulo , denoted by , with addition and composition as operations, we will consider as an -subspace of . Given two -linear RM-codes, and , they are equivalent if and only if there exist , permuting and such that
[TABLE]
where stands for the composition of maps and for . For a rank metric code given by a set of linearized polynomials, its left and right idealisers can be defined as:
[TABLE]
[TABLE]
If has maximum cardinality , then we may always assume (up to equivalence) that
[TABLE]
the same holds for the right idealiser, see [7, Theorem 6.1] and [8, Theorem 2.2]. Hence, when the left idealiser is , results to be closed with respect to the left composition with the -linear maps; while if the right idealiser is , then is closed with respect to the right composition with the -linear maps. For this reason, when (resp. ) is equal to we say that is -linear on the left (resp. right) (or simply -linear if it is clear from the context).
The notion of Delsarte dual code can be written in terms of -polynomials as follows, see for example [29, Section 2]. Let be the bilinear form given by
[TABLE]
where and , and is the trace function . The Delsarte dual code of a set of -polynomials is
[TABLE]
Only few families of MRD-codes are known, due to the results in [1, 4, 33]. In [16], Delsarte gives the first construction for linear MRD-codes (he calls such sets Singleton systems) from the perspective of bilinear forms. Few years later, Gabidulin in [17, Section 4] presents the same class of MRD-codes by using linearized polynomials. Although these codes have been originally discovered by Delsarte, they are called Gabidulin codes. Kshevetskiy and Gabidulin in [21] generalize the previous construction obtaining the so-called generalized Gabidulin codes
[TABLE]
with and . The RM-code is an -linear MRD-code with parameters and , see [22, Lemma 4.1 & Theorem 4.5]. Note that, as proved in [17, 21], this family is closed with respect to the Delsarte duality, more precisely is equivalent to . This family of MRD-codes has been characterized by Horlemann-Trautmann and Marshall in [20] as follows.
Theorem 6.1**.**
[20, Theorem 4.8]** An -linear MRD-code having dimension (over ) is equivalent to a generalized Gabidulin code if and only if there is an integer with and , where .
Very recently, Neri in [32] removed the hypothesis on to be an MRD-code.
Sheekey in [37] proves that with , the set
[TABLE]
with and such that , is an -linear MRD-code of dimension with parameters . This code is called generalized twisted Gabidulin code. Lunardon, Trombetti and Zhou in [29], generalizing the results of [37], determined the automorphism group of the generalized twisted Gabidulin codes and proved that, up to equivalence, the generalized Gabidulin codes and the twisted Gabidulin codes are both proper subsets of this class. Clearly, for we have exactly the generalized Gabidulin code . Also, the authors in [29, Corollary 5.2] determined the left and right idealisers: if , then
[TABLE]
The class of generalized twisted Gabidulin codes is closed with respect to the Delsarte duality, more precisely is equivalent to , [37, Theorem 6] and [29, Propositions 4.2]. We are interested in the case when , i.e.
[TABLE]
which is -linear (more precisely it is an -linear MRD-code -linear on the left). This family has been characterized in [19].
Theorem 6.2**.**
[19, Theorem 3.9]** Let be an -linear MRD-code having dimension . Then, the code is equivalent to a generalized twisted Gabidulin code if and only if there exists an integer such that and such that the following two conditions hold
* and , i.e. there exist such that*
[TABLE] 2. 2.
* is invertible and there exists such that .*
Apart from the two infinite families of -linear MRD-codes (i.e. and ), there are few other examples known for , which arise from the connection with scattered linear sets we are going to explain.
In [37, Section 5] Sheekey showed that scattered -subspaces of of dimension yield -linear MRD-codes with parameters with left idealiser isomorphic to ; see [9, 10, 38] for further details on such kind of connections. Let us recall the construction from [37]. Let be a scattered -subspace of . The set
[TABLE]
corresponds to a set of matrices over forming an -linear MRD-code with parameters . Also, since is an -subspace of , its left idealiser is isomorphic to . For further details see [7, Section 6]. Furthermore, let and be two MRD-codes arising from maximum scattered subspaces and of . In [37, Theorem 8] the author showed that there exist invertible matrices , and such that if and only if and are -equivalent, i.e. he proved that the equivalence of the rank metric codes coincides with the -equivalence of the corresponding subspaces.
As a consequence we get the following result.
Theorem 6.3**.**
If , and , then the RM-code is an -linear MRD-code with parameters and left idealiser isomorphic to , and is not equivalent to any previously known MRD-code.
Proof.
From [7, Section 6], the previously known -linear MRD-codes with parameters and with left idealiser isomorphic to arise, up to equivalence, from one of the maximum scattered subspaces of described in Section 5.1. From Corollary 5.6 the result then follows. ∎
6.1 Scattered linear sets and MRD-codes
Lunardon in [24, Section 3] (see also [38, Theorem 3.4] and [10, Section 4.1]) proved that if , with , is a scattered777The statement is more general, we have adapted it to our case. -subspace of , then it can be obtained as a special quotient. By [37, Section 5], it follows that
[TABLE]
is an MRD-code. We may assume that the coefficient of in is zero and . Denoting with and
[TABLE]
it is straightforward to see that
[TABLE]
We can embed in in such a way that the vector corresponds to the vector with if , and . Note that corresponds to the -dimensional subspace with equations where .
Let be the -subspace of of dimension represented by the equations
[TABLE]
and let . Note that
[TABLE]
where . It can be seen that and
[TABLE]
This link suggests a new proof of the equivalence between the assertions 1. and 2. of Theorem 1.1. In the following we will assume that is a scattered linear set of with rank .
Proof.
(Theorem 1.1) Assume that is of pseudoregulus type, then by [12] we have that if then is -equivalent to
[TABLE]
Therefore if , then , with
[TABLE]
i.e. with , and . Denote by the collineation of defined by , which fixes precisely the points of . Therefore, we have that and clearly is a generator of the subgroup of fixing pointwise.
Conversely, let with , , , . Note that with
[TABLE]
for some linearized polynomials . It follows that
[TABLE]
where and
[TABLE]
[TABLE]
We may assume that and for some , choose as the -subspace having equations for . Therefore, we have
[TABLE]
So, and results to be a scattered -subspace of , i.e. by [37, Section 5] is an MRD-code. It follows that is an MRD-code with and . By Theorem 6.1, is equivalent to . It follows that is -equivalent to and hence is of pseudoregulus type. ∎
In [32], Neri gives a characterization of generalized Gabidulin codes using the standard form of their generator matrix. This suggests a further different approach to the characterization of linear sets of pseudoregulus type.
For linear sets of LP-type, as done for the pseudoregulus case, it follows that one of the possible -subspaces representing a linear set of LP-type can be obtained as in (13), choosing in such a way that . Since a characterization of generalized twisted Gabidulin codes is known, see Theorem 6.2 with , it follows that a scattered linear set is of LP-type if and only if there exists an -subspace of such that , where is as in (13) and the rank-metric code associated to satisfies the hypothesis of Theorem 6.2 with . In contrast to the above characterization, those presented in the previous sections are purely geometric and take into account the problem of the possible -subspaces representing a linear set of LP-type.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. Bartoli and Y. Zhou: Exceptional scattered polynomials, J. Algebra 509 (2018), 507–534.
- 2[2] A. Blokhuis and M. Lavrauw: Scattered spaces with respect to a spread in PG ( n , q ) PG 𝑛 𝑞 \mathrm{PG}(n,q) , Geom. Dedicata 81 (2000), 231–243.
- 3[3] G. Bonoli and O. Polverino: 𝔽 q subscript 𝔽 𝑞 \mathbb{F}_{q} -linear blocking sets in PG ( 2 , q 4 ) PG 2 superscript 𝑞 4 \mathrm{PG}(2,q^{4}) , Innov. Incidence Geom. 2 (2005): 35–56.
- 4[4] sc Byrne E., Ravagnani, A.: Partition-balanced families of codes and asymptotic enumeration in coding theory, https://arxiv.org/abs/1805.02049 .
- 5[5] B. Csajbók, G. Marino and O. Polverino: Classes and equivalence of linear sets in PG ( 1 , q n ) PG 1 superscript 𝑞 𝑛 \mathrm{PG}(1,q^{n}) , J. Combin. Theory Ser. A 157 (2018), 402–426.
- 6[6] B. Csajbók, G. Marino and O. Polverino: A Carlitz type result for linearized polynomials, Ars Math. Contemp. 16(2) (2019), 585–608.
- 7[7] B. Csajbók, G. Marino, O. Polverino and C. Zanella: A new family of MRD-codes, Linear Algebra Appl. 548 (2018), 203–220.
- 8[8] B. Csajbók, G. Marino, O. Polverino and Y. Zhou: Maximum Rank-Distance codes with maximum left and right idealisers, https://arxiv.org/abs/1807.08774 .
