WorksMathematics
The Cooperstein conjecture and additive alternating -codes
Abstract
Let be the second exterior power of a vector space over a finite field. The Cooperstein conjecture asserts a dimension bound for flats external to varieties consisting of points of bounded rank in . This geometric problem can be translated into a question about linear spaces of alternating matrices whose nonzero elements have rank at least a prescribed value. For matrices of odd order, the sharp cardinality bound was already established by Delsarte and Goethals (1975). In this paper, we prove the Cooperstein conjecture for matrices of even order and, more generally, we prove its additive analogue by determining, for all admissible parameters, the maximum size of an additive subgroup of alternating matrices in which every nonzero matrix has at least the prescribed rank. Our proof uses Pfaffian equations to characterize alternating matrices of rank below the prescribed minimum. We study the minimal graded free resolutions of the corresponding Pfaffian rings. The Cohen–Macaulay property and the -invariant of each Pfaffian ring determine the largest shift in its resolution. We use trace functions on evaluation quotients to construct polynomial indicators for the matrices of small rank in an additive subgroup. The largest shift controls their degrees, yielding the upper bound by a counting argument. Finally, we give explicit trace constructions attaining the bound.
Introduction
Let be the finite field of order , where is prime and is a positive integer. Let denote the -vector space of matrices over . Let be an -dimensional vector space over , and set , the second exterior power of , with basis . Here denotes the exterior product. We have . Set . Every nonzero can be written as
where are linearly independent. The integer is uniquely determined by and is called the rank of ; it satisfies . Multiplication by a nonzero scalar preserves this rank. Consequently, it also defines a rank on the points of . For , let be the set of points of of rank at most . An -linear subspace determines an external flat to the variety if . Cooperstein studied the largest possible dimension of such subspaces and proposed the following conjecture [3 p. 224].
Conjecture 1.1. Let , and let be an -linear subspace such that . Then
This problem has an equivalent formulation in terms of alternating matrices. A matrix is said to be alternating if and all its diagonal entries are zero, where denotes the transpose of . We denote by the -vector space of alternating matrices in . The basis of defines an -linear isomorphism
where , for and . Under this isomorphism, an element of rank corresponds to a matrix of rank ; see e.g. [3 Section 3]. This correspondence leads naturally to the notion of an alternating -code. The rank distance on is . A nonempty subset is a -code if for all distinct . It is additive if it is an additive subgroup, or equivalently an -linear subspace. Since alternating matrices have even rank, we consider even with . The condition on in Conjecture 1.1 says precisely that is an -linear -code.
The extremal problem for alternating -codes forms part of the broader study of rank-metric codes in classical form spaces, namely the spaces of alternating and symmetric bilinear forms and of Hermitian sesquilinear forms. After choosing bases, these are represented by alternating, symmetric, and Hermitian matrices, respectively. A maximum additive -code is an additive -code of largest possible cardinality in its ambient form space. Schmidt established bounds and constructions for symmetric -codes in odd and even characteristic [23, 24, 26] and for Hermitian -codes [25], see also [16, 28]. In the Hermitian case, Santonastaso and Zhou Santonastaso and Zhou [22] showed that the upper bound of Schmidt [25] for additive -codes is attained for every admissible choice of parameters. In these settings, the maximum size of an arbitrary -code remains unknown for some parameters, even when the corresponding additive problem has been solved, see e.g. [4, 19]. Perfect codes in classical form spaces have also been studied in the symmetric, alternating, and Hermitian settings; see [21], [1], and [20], respectively.
For alternating -codes, Delsarte and Goethals studied the general problem without assuming additivity [5]. For , with , their bound is
Suppose that is odd, so that . If is as in Conjecture 1.1, then is an -linear -code. Applying (2) with gives
Hence , as conjectured.
For even and , Conjecture 1.1, with , predicts that an -linear -code has cardinality at most . On the other hand, the exponent in the Delsarte–Goethals bound satisfies
Thus, for , the upper bound in (2) is larger than the conjectured upper bound by a factor of and therefore does not imply Conjecture 1.1. Abiad, Alfarano and Ravagnani Abiad, Alfarano and Ravagnani [1] recovered the Delsarte–Goethals bound for using spectral methods.
For -linear codes, Cooperstein proved the conjectured bound for [3 Theorem 6.1] and for when is even [3 Theorem 5.1]. These two cases were also treated by Gow and Quinlan [8]. Gow subsequently proved the conjectured linear bound for when is even [7 Theorem 7].
The special cases just discussed concern -linear codes. For and , the conjectured dimension bound for such a code is . Since , this gives a bound on the cardinality of . The additive analogue of Conjecture 1.1 asserts that the same cardinality bound holds for every additive -code , namely
This assertion extends Conjecture 1.1, since every -linear code is additive, but an additive subgroup need not be an -linear subspace.
Our contribution. We prove Conjecture 1.1 and its additive analogue over every finite field, determining the maximum size of an additive alternating -code for all admissible parameters.
Theorem 1.2. Let , let , and let be even with . Every additive -code satisfies
Moreover, equality is attained by an -linear code for every such , and . Consequently, if is a subfield and is -linear, then
and this bound is also sharp.
For as in Conjecture 1.1, applying Theorem 1.2 to with gives .
The strategy of the proof is as follows. For even , let be the polynomial ring over in the independent entries of a generic alternating matrix, and let be the ideal generated by its Pfaffians of order . The zeros of are precisely the matrices of rank at most (Lemma 2.1). Our proof studies the quotient , called a Pfaffian ring, with its standard grading and a minimal graded free resolution as an -module. The shifts in this resolution determine the Hilbert series, whose degree as a rational function is the -invariant. Writing , the Cohen–Macaulay property of implies that the largest shift equals . Proposition 3.1 gives , and hence the largest shift is . The largest shift controls the degree of the polynomial indicator used in our counting argument. Write and choose an -basis of a nonzero additive subgroup . Substituting into the Pfaffian equations gives a system whose solutions in correspond bijectively to the matrices in of rank at most . Using traces of Frobenius, we construct a polynomial of degree at most that equals 1 at these solutions and 0 elsewhere in (Theorem 4.6). If , or equivalently , the degree of this polynomial is less than , so its sum over vanishes by Lemma 4.5. Consequently, the number of matrices in of rank at most is divisible by . Since the zero matrix is counted, contains a nonzero matrix of rank at most (Theorem 5.1). Thus an additive -code with would contain a nonzero matrix of rank less than , a contradiction. This proves the upper bound in Theorem 1.2 for . The case is immediate. Finally, Proposition 5.3 gives -linear codes attaining the bound for both parities of and in every characteristic.
Preliminaries
We recall the basic properties of alternating matrices and forms and Pfaffians, together with the notions of graded modules and free resolutions used in the sequel.
Alternating forms and Pfaffians
Let and let be an integer. Let be an -dimensional -vector space. A bilinear form is said to be alternating if for every . We denote by the -vector space of alternating bilinear forms on . Fix an ordered -basis of . The matrix representing a bilinear form in this basis is
The form is alternating if and only if is alternating. Hence, after fixing , the map
is an -linear isomorphism, see [15 Chapter XIII, §6, Proposition 6.5]. In particular,
since an alternating matrix is uniquely determined by its entries above the diagonal. We define . This definition is independent of the chosen basis. Every alternating form admits an ordered basis in which its representing matrix is
for some integer ; see [15 Chapter XV, §8, Theorem 8.1, pp. 586–587]. Here denotes the zero matrix of order . Consequently, , so every alternating form, and hence every alternating matrix, has even rank.
We endow with the rank metric, defined by
for all . Via (6), we use the same notation for the rank metric on . Thus an alternating (rank-metric) code is a nonempty subset , or, after fixing , a nonempty subset . If , its minimum distance is
For a singleton code, we set . Since every alternating matrix has even rank, we take to be an even integer satisfying . We call an **alternating (rank-metric) -code if , equivalently if the difference of any two distinct codewords has rank at least . An additive alternating (rank-metric) code is an alternating rank-metric code that is an additive subgroup of . For such a code, the -code condition is equivalent to requiring that every nonzero codeword has rank at least . The corresponding extremal problem is to maximize among additive alternating -codes in .
We recall the definition of the Pfaffian of an alternating matrix. Let , and denote by the symmetric group on . Let be the subset consisting of the permutations satisfying
For an alternating matrix , the Pfaffian of is
where denotes the sign of ; see e.g. [9 p. 12]. For an alternating matrix of odd order, we set . The Pfaffian satisfies
see e.g. [15 Chapter XV, §9, Theorem 9.1].
Let . For a subset of even cardinality, denote by
the principal submatrix obtained by considering the rows and columns indexed by , in increasing order. Note that is again an alternating matrix, so its Pfaffian is well defined. We set .
Lemma 2.1. Let and let be an integer with . Then if and only if , for every , with .
Proof. If , every principal submatrix of order is singular. Equation (7) therefore gives for every such . Conversely, suppose that . Since alternating matrices have even rank, . Over a field, [13 Theorem 3.12(2)–(3)] implies that an alternating matrix with a nonzero minor of even order has a nonzero principal minor of the same order. Hence there is a subset of size such that . Equation (7) then gives . □
Graded modules and free resolutions
We recall the notions and properties of graded rings and modules that will be needed in the sequel. Let be an abelian semigroup with identity . An -graded ring is a ring endowed with a decomposition into additive subgroups
such that and for all . This decomposition is called an -grading of . In particular, is a subring of . Unless otherwise specified, a graded ring means a -graded ring.
Let be an -graded ring. An -module is an -graded -module if it has a decomposition into additive subgroups
satisfying , for all . Each is an -module and is called the degree- component of . A nonzero element is said to be homogeneous of degree , and we write . The nonzero elements of are also called forms of degree . Every has a unique expression , with , with only finitely many . A graded module means a -graded module. An -module homomorphism between -graded -modules is graded if , for all . Thus a graded homomorphism preserves degrees. Let be an -graded -module and let be a graded submodule; that is, is graded with the induced grading
In this case the quotient inherits an -grading, with
We use . An -grading is regarded as a -grading by setting all components of negative degree equal to zero.
Let be a field and let be the polynomial ring in variables. The standard grading of is the -grading defined by for every . For , its component is the -vector space of homogeneous polynomials of total degree , including zero. We set for . Thus
In particular, every component of a graded -module is an -vector space. The ring is itself a graded -module. A graded -module is called graded free if it is a free -module with a homogeneous basis, that is, an -basis consisting of homogeneous elements.
Definition 2.2. For any -graded -module and any , denote by the graded shifted module: it is the same underlying -module, with homogeneous components
where for .
A nonzero homogeneous element of degree in has degree in . In particular, , and the element has degree in .
We recall the notion of graded free resolution, see e.g. [14 Definition 4.8.1].
Definition 2.3. Let be a nonzero finitely generated -graded -module. A finite graded free resolution of is an exact sequence
where , each is a finitely generated graded free -module, and all maps are graded -module homomorphisms. If , the integer is called the length of the resolution.
Let and consider the -module
The gradings of the summands induce an -grading on , whose degree- component is
For each , let be the vector whose th component is 1 and whose other components are zero. Then form an -basis of , and is homogeneous of degree . Consequently, is a finitely generated graded free -module. More explicitly, every element of has a unique expression
and this element belongs to if and only if for every .
Theorem 2.4 (Hilbert’s Syzygy Theorem; see e.g. [29], Proposition 3.5.6 and Theorem 3.5.7). Let be a nonzero finitely generated -graded -module. Then admits a finite graded free resolution
where , each is a positive integer, each belongs to , and all maps are graded -module homomorphisms. Moreover, the maps satisfy
A graded free resolution (8) is called minimal if all entries of the matrices representing with respect to homogeneous bases belong to ; see [29], Remark 3.5.9 and Definition 3.5.13. In particular, the resolution provided by Theorem 2.4 is minimal and unique up to complex isomorphism; see [29], Corollary 3.5.8. The integers are called the shifts of the resolution.
The largest shift for a Pfaffian ring
Let , let , and let with its standard grading. An ideal of is called homogeneous if it is generated by homogeneous polynomials; equivalently, it is a graded -submodule of . Let be a homogeneous ideal, and put , with the quotient grading. By Theorem 2.4, we may fix a finite minimal graded free resolution of ,
where , each is a positive integer, and for all . We denote by
the largest shift in this resolution. We determine the largest shift in a minimal graded free resolution of a Pfaffian ring over its ambient polynomial ring, using its Cohen–Macaulay property and -invariant.
Hilbert series and the -invariant
An -graded -algebra is called standard graded if its degree-zero component is and it is generated as an -algebra by finitely many homogeneous elements of degree one; see [29 Definition 3.1.14]. The quotient has this property. Indeed, since is proper and homogeneous, , so . Moreover, the classes of generate as an -algebra, and their nonzero classes have degree one. Each component is finite-dimensional over , since it is a quotient of . The Hilbert series of is
see [29 Section 5.1]. Since is generated as an -module by , we take and let be the quotient map. Thus consists of a single summand , so and . Define
Since is a polynomial ring with its standard grading, [29 Eq. (5.1), p. 151], applied to (9), gives
Comparison of constant terms yields . In particular, is nonzero. For , the resolution consists only of , and (11) gives
For nonzero polynomials , the degree of the rational function is , independently of the chosen representation. Following [29 Definition 5.1.5], we define the -invariant of as the degree of its Hilbert series as a rational function. Thus
In particular, (12) gives
Application to Pfaffian rings
Let be an integer and suppose that . Put
Take and index the variables of as , where . Thus
Let be the generic alternating matrix over , defined by
We use the principal-submatrix notation and the polynomial definition of the Pfaffian from Section 2.1. That definition applies also to matrices with entries in , in every characteristic.
Set
and
The ideal is a Pfaffian ideal and the quotient is called a Pfaffian ring; see [6, 9, 11]. Each generating Pfaffian is homogeneous of degree . It is also nonzero: if , the monomial occurs with coefficient 1, and distinct pairings give distinct monomials. Since , such subsets exist. Moreover, all generators have positive degree, so
Hence is a nonzero proper homogeneous ideal, and is a standard graded quotient of the form considered above, with and .
Generic Pfaffian rings are Cohen–Macaulay over every field, as proved in [12] and [17, 18]; see also [9 Section 6].
Proposition 3.1. The -invariant of the Pfaffian ring is
The largest shift in its minimal graded free resolution over is .
Proof. We consider with the grading induced by the standard grading of . In the notation of [2 Corollary 1.7, p. 206], this corresponds to , since
Since , we have , and [2 Corollary 1.7, p. 206] gives
The ideal is nonzero, proper, and homogeneous, and is Cohen–Macaulay. By [29 Proposition 5.2.3(a)],
Hence, by [29 Proposition 5.2.3(b)] and (14), we obtain
as required.
Trace functions and counting criteria
We introduce trace functions on evaluation quotients of modules and prove their additivity. We use this property together with Frobenius maps to construct polynomial indicators. Bounds on their degrees yield a counting criterion over subfields. Let be the finite field with elements of characteristic , and let , where , with its standard grading. All -modules considered in this section are assumed to be finitely generated.
Quotient modules and trace functions
For , evaluation at defines a surjective -algebra homomorphism , , with kernel . For an -module , we define the quotient module
and write for the class of . Since , we have , for all , and is naturally an -vector space. The classes of any finite set of generators of span over , so is finite-dimensional. Also, if is free with basis , then form an -basis of . Every -module homomorphism induces an -linear map
Let , where . An additive map is called -linear if for all and . For every , such a map satisfies
where denotes the ordinary ideal power. It therefore induces an additive map
This map satisfies for all , . In particular, if , then is -linear.
Let and be -modules equipped with -linear maps and . An -module homomorphism is called compatible with and if . In this case, for every , the induced maps satisfy . More generally, consider a sequence of -module homomorphisms
and let be a -linear map for each . We say that the maps are compatible with the sequence if for all . For a -linear map , define
the trace of the induced -linear endomorphism . The function
is called the trace function of . For a square matrix over a commutative ring, let denote the sum of its diagonal entries. If is free with basis , write
The induced map is represented in the basis by . Hence
This includes , with the empty sum equal to zero.
For an ideal , set
The following proposition relates trace functions to the number of common zeros of an ideal.
Proposition 4.1. Let be an ideal, put , and consider the -linear map
For every ,
Consequently,
In particular, this sum is zero if and only if divides .
Proof. Fix . Since , we have
Indeed, every product , with and , is represented by an element of , since is an ideal. Conversely, belongs to for every . Therefore, there is a canonical -linear isomorphism
Suppose that . Then every element of vanishes at , so and . Since evaluation at is surjective and has kernel , it induces an -linear isomorphism
Moreover,
because . Thus, under this identification, corresponds to the identity map on , and hence . If , choose with . Since , we have
Thus contains a unit of , so and . Its endomorphism has trace zero. This proves (17). Summing over gives the asserted identity.
Passing to the quotients need not preserve injectivity. To prove additivity of trace functions, we shall use the following consequence of the Artin–Rees Theorem.
Lemma 4.2 (Artin–Rees). Let be a commutative noetherian ring, let be an ideal, let be a finitely generated -module, and let be a submodule. There is an integer such that
In particular, for every .
Proof. By the Artin–Rees Theorem, see [15 Chapter X, §5, Corollary 5.5], there is such that
For , the last module is contained in .
Proposition 4.3. Let
be an exact sequence of finitely generated -modules, equipped with compatible -linear maps , , . Then, for every ,
Proof. Fix and put . Since is surjective and -linear, we have . The induced map is also surjective. Next, we determine . For , the definition of gives
Since , this is equivalent to the existence of such that . By exactness, , so for some . Conversely, every element of this form has image under in . Therefore
Moreover, since , we have . Thus every element of belongs to . The reverse inclusion follows from , and hence
Similarly, for ,
The -linearity of gives , so . Consequently,
Put , and let be the surjective map defined by
We obtain two exact sequences of finite-dimensional -vector spaces:
where the maps from and into and , respectively, are the inclusions. Therefore, we have the following isomorphisms of -vector spaces:
Compatibility gives
The identity shows that is invariant under and is invariant under . Set
We claim that is nilpotent. For every integer , iterating -linearity and compatibility gives
In particular, we get . Apply Lemma 4.2 to the submodule . There is such that
where the equality follows from the -linearity of . Choose with . For every , we have , and therefore
Since is injective, this implies . Thus induces the zero map on , so
The trace of an endomorphism is the sum of its traces on an invariant subspace and the corresponding quotient. Applying this fact to the two exact sequences above and using the decompositions in (18) gives
Since the trace on is zero, we conclude that
Remark 4.4. For trace functions and their additivity in a more general setting, see [27 Definition 1.9 and Exercise 1.2].
A counting criterion over subfields
Let be a subfield. Throughout this subsection, write and , so that .
We first recall a standard identity for polynomial sums; see, for example, [10 p. 120].
Lemma 4.5. Let be a finite field of order , and let . If is zero or has total degree less than , then
Let be a homogeneous ideal, and put , with its quotient grading. Since is a nonzero finitely generated -graded -module, Theorem 2.4 allows us to fix a finite minimal graded free resolution
where , each is a positive integer, and for all . Set
Theorem 4.6. With the above notation, let , write , and let
where are homogeneous linear forms, possibly zero. Then there is a polynomial of total degree at most such that, for every ,
In particular, if , then
Proof. Consider the -power Frobenius
It is well defined because implies . It is -linear and sends into for every .
We first construct -linear maps such that
Choose homogeneous bases of , with .
For each basis vector of , choose such that
This is possible because is surjective and graded. Extend these assignments by
The resulting map is well defined and -linear, and satisfies the required degree and compatibility properties. Now, suppose that have been constructed. For a homogeneous basis vector of , compatibility gives
and
By exactness, belongs to . It also belongs to . Since preserves degree, we may choose such that
Indeed, the component of degree of any preimage is still a preimage. When the required image is zero, choose . Extend the assignments -linearly to . The required properties hold on the basis and hence on all of .
Write
Every nonzero entry of is homogeneous of degree
The maps are -linear and compatible with the resolution. Moreover, , where is the -power Frobenius of Proposition 4.1.
Let be the automorphism . Its fixed field is , and is the identity. Extend to by applying it to coefficients and fixing the variables. We also apply entrywise to matrices and column vectors.
Set
where when , and define
We first verify (19). By (15), applied with , each induces a map on for every . In the basis , this map acts on coefficient columns by . Hence, the -linear map has representative matrix . Let and put . Since fixes the coordinates of , for every integer we have
Hence is the matrix of , and
Put , , and for . By exactness, and for . Thus each is finitely generated, since each is finitely generated.
Compatibility implies that preserves . Let be the restriction of to , and put . For each , we have a short exact sequence
where the codomain of is restricted to its image. The -linear maps , , and are compatible with this sequence. Hence Proposition 4.3 gives
Taking alternating sums, the intermediate terms cancel, and the term involving vanishes because . Consequently,
where the last equality follows from Proposition 4.1. This proves (19).
We next show that has coefficients in . For , this is immediate. For , the identity and cyclic invariance of the matrix trace give
Thus every coefficient of is fixed by and belongs to . The same holds for .
It remains to bound the degree. Substitution of homogeneous linear forms sends a homogeneous polynomial to either zero or a homogeneous polynomial of the same degree, and preserves degree. A summand in the expansion of has the form
where . If this product is nonzero, its degree is, by (20),
Therefore every monomial occurring in has degree at most . Since is proper and homogeneous and , (19) gives . In particular, and
Finally, if , then . Lemma 4.5, applied over , yields
By (19), this sum equals . Since , the required divisibility follows. □
Bounds and constructions for additive alternating codes
In this section, we prove Theorem 1.2, determining the maximum size of an additive alternating -code and constructing -linear codes attaining this maximum for every admissible choice of parameters. We first apply the counting criterion of § 4.2 to the Pfaffian ideal, and then construct codes attaining the resulting bound.
Throughout this section, let , where , let , and put . We identify with by listing the entries above the diagonal in lexicographic order.
The upper bound
Theorem 5.1. Let be an integer and suppose that . If an additive subgroup satisfies , then
In particular, contains a nonzero matrix of rank at most .
Proof. Put and . Since , the hypothesis is equivalent to . Choose an -basis of , and define
Let be the -tuple of entries of above the diagonal, in lexicographic order. Each entry of is a homogeneous linear form over , and is a bijection.
Let and consider the Pfaffian ideal from § 3. Proposition 3.1 shows that the largest shift of is . Moreover, Lemma 2.1 gives
Apply Theorem 4.6 with , , and . Since and , it follows that
The bijection proves the required congruence. The zero matrix belongs to the set being counted, so its cardinality is a positive multiple of . Consequently, this set contains a nonzero matrix. □
We are now ready to prove Theorem 1.2, which we restate for convenience.
Theorem 5.2. Let , let , and let be even with . Every additive -code satisfies
Moreover, equality is attained by an -linear code for every such , and . Consequently, if is a subfield and is -linear, then
and this bound is also sharp.
Proof. Let be an additive -code. For , the cardinality bound is simply . Suppose that and put . Then , , and
If , by Theorem 5.1 we know that there exists a nonzero matrix in of rank at most . This contradicts the -code condition and proves (22).
Finally, let be a subfield and suppose that is -linear. Such a code is additive, and
Substitution in (22) gives (23). The sharpness assertions follow from Proposition 5.3 below. □
For as in Conjecture 1.1, is an -linear -code of dimension . By the above theorem,
This proves the Cooperstein conjecture.
Codes attaining the bound
We now give trace constructions attaining the upper bound. Codes with the required parameters were already constructed by Delsarte and Goethals for odd [5 Theorem 7], and by Cooperstein for both even and odd [3 Theorem 4.1 and Remark 4.2]. We give a linearized-polynomial description and verify their dimensions and the -code condition directly. Set , viewed as an -dimensional vector space over , and write and , where . A -polynomial over is a polynomial , with coefficients . For nonzero , its -degree is the largest index for which . Such a polynomial induces an -linear map on , and a nonzero -polynomial of -degree at most has at most roots. Let
Evaluation on identifies with . The field trace is . It is -linear, and the pairing is nondegenerate. Every -bilinear form on has a unique representation
see e.g. [23 Lemma 13] and [16 Proposition 2.1]. Thus is an -linear isomorphism from to the space of -bilinear forms on and
Under this correspondence, the alternating forms are represented by the -subspace
For odd , the coefficients are arbitrary in and determine all the others. For even , the coefficients are arbitrary in , while belongs to , where . If , let consist of the -polynomials
If , let consist of the -polynomials
where and satisfies . In both cases, is an -subspace of . Define
where is given by (24). After choosing an ordered -basis of , we may also regard as a code in via (6).
Proposition 5.3. The set is an -linear alternating -code of dimension over . In particular, it is an additive alternating -code attaining (22).
Proof. All exponent indices in (27) and (28) are distinct and less than , so the coefficients uniquely determine the parameters. For odd , there are free parameters in , giving
For even , there are free parameters in , and the middle coefficient belongs to , which has dimension over . Therefore,
Finally, let . All exponent indices of lie in . Compose its induced map on the right with the bijection . Using on , the resulting map is represented by a nonzero -polynomial whose exponent indices lie in . Indeed, each index becomes modulo , and these indices remain distinct. Then
By (25),
Since is -linear, this proves the -code condition.
Proposition 5.3 gives an -linear alternating code attaining (22) for every admissible , and . For every subfield , the same code has
so (23) is sharp as well.
Acknowledgments
The author is partially supported by the Italian National Group for Algebraic and Geometric Structures and their Applications (GNSAGA- INdAM).
Declaration of AI use
The author proposed the use of Pfaffian equations to describe the variety of alternating matrices of bounded rank and to count its points in an additive subgroup to obtain an upper bound on the size of an additive alternating code. Building on this idea, ChatGPT 6-Astra provided the counting theorem over subfields (Theorem 4.6), which uses the largest shift in a minimal graded free resolution to bound the degree of a polynomial indicator. The author subsequently developed, refined, and independently verified all arguments and takes full responsibility for the contents of the paper.
Paolo Santonastaso, Department of Mathematics and Applications “R. Caccioppoli”, University of Naples Federico II, Via Cintia, Monte Sant’Angelo, 80126 Naples, Italy
Email address: [email protected]
References
- [1]A. Abiad, G. N. Alfarano, and A. Ravagnani. Eigenvalue bounds and alternating rank-metric codes. Journal of Algebra and its Applications, 24(13–14):2541011, 2025.arxiv.org/abs/2405.09254
- [2]W. Bruns and J. Herzog. On the computation of a-invariants. Manuscripta mathematica, 77(1):201–213, 1992.DOI
- [3]B. N. Cooperstein. External flats to varieties in PG(∧²(V)) over finite fields. Geometriae Dedicata, 69(3):223–235, 1998.DOI
- [4]A. Cossidente, G. Marino, and F. Pavese. On symmetric and Hermitian rank distance codes. Journal of Combinatorial Theory, Series A, 188:105597, 2022.arxiv.org/abs/2011.06942
- [5]P. Delsarte and J.-M. Goethals. Alternating bilinear forms over GF(q). Journal of Combinatorial Theory, Series A, 19(1):26–50, 1975.DOI
- [6]S. R. Ghorpade and C. Krattenthaler. The Hilbert series of Pfaffian rings. In C. Christensen, A. Sathaye, G. Sundaram, and C. Bajaj, editors, Algebra, Arithmetic and Geometry with Applications, pages 337–356. Springer, Berlin, Heidelberg, 2004.
- [7]R. Gow. Rank-related dimension bounds for subspaces of bilinear forms over finite fields. arXiv preprint arXiv:1703.07266, 2017.arxiv.org/abs/1703.07266
- [8]R. Gow and R. Quinlan. On the vanishing of subspaces of alternating bilinear forms. Linear and Multilinear Algebra, 54(6):415–428, 2006.DOI
- [9]M. Hochster, J. Jeffries, V. Pandey, and A. K. Singh. When are the natural embeddings of classical invariant rings pure? Forum of Mathematics, Sigma, 11:e67, 2023.arxiv.org/abs/2210.09351
- [10]X.-d. Hou. Lectures on Finite Fields, volume 190 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2018.DOI
- [11]T. Józefiak and P. Pragacz. Ideals generated by Pfaffians. Journal of Algebra, 61(1):189–198, 1979.DOI
- [12]H. Kleppe and D. Laksov. The algebraic structure and deformation of Pfaffian schemes. Journal of Algebra, 64(1):167–189, 1980.DOI
- [13]V. Kodiyalam, T. Y. Lam, and R. G. Swan. Determinantal ideals, Pfaffian ideals, and the principal minor theorem. In Noncommutative Rings, Group Rings, Diagram Algebras and Their Applications, volume 456 of Contemporary Mathematics, pages 35–60. American Mathematical Society, Providence, RI, 2008.DOI
- [14]M. Kreuzer and L. Robbiano. Computational Commutative Algebra 2. Springer, 2005.
- [15]S. Lang. Algebra, volume 211 of Graduate Texts in Mathematics. Springer-Verlag, New York, revised third edition, 2002.
- [16]G. Longobardi, G. Lunardon, R. Trombetti, and Y. Zhou. Automorphism groups and new constructions of maximum additive rank metric codes with restrictions. Discrete Mathematics, 343(7):111871, 2020.DOI
- [17]V. P. Marinov. Perfection of ideals generated by the Pfaffians of an alternating matrix. I. Serdica, 9(1):31–42, 1983.
- [18]V. P. Marinov. Perfection of ideals generated by the Pfaffians of an alternating matrix. II. Serdica, 9(2):122–131, 1983.
- [19]M. Messia and F. Zullo. Non-additive symmetric rank-metric codes. arXiv preprint arXiv:2610.18061, 2026.arxiv.org/abs/2610.18061
- [20]U. Mushrraf. Perfect Hermitian rank-metric codes. The Art of Discrete and Applied Mathematics, 9(2):P2.08, 2026.arxiv.org/abs/2409.16753
- [21]U. Mushrraf and F. Zullo. On perfect symmetric rank-metric codes. Archiv der Mathematik, 125:259–271, 2025.arxiv.org/abs/2406.12450
- [22]P. Santonastaso and Y. Zhou. New maximum Hermitian d-codes and new invariants from skew polynomial rings. arXiv preprint arXiv:2610.26048, 2026.arxiv.org/abs/2610.26048
- [23]K.-U. Schmidt. Bilinear forms over finite fields of even characteristic. Journal of Combinatorial Theory, Series A, 117(8):1011–1026, 2010.DOI
- [24]K.-U. Schmidt. Symmetric bilinear forms over finite fields with applications to coding theory. Journal of Algebraic Combinatorics, 42(2):635–670, 2015.arxiv.org/abs/1410.7184
- [25]K.-U. Schmidt. Hermitian rank distance codes. Designs, Codes and Cryptography, 86(7):1469–1481, 2018.arxiv.org/abs/1702.02793
- [26]K.-U. Schmidt. Quadratic and symmetric bilinear forms over finite fields and their association schemes. Algebraic Combinatorics, 3(1):161–189, 2020.arxiv.org/abs/1803.04274
- [27]L. Taelman. Sheaves and Functions Modulo p: Lectures on the Woods Hole Trace Formula, volume 429 of London Mathematical Society Lecture Note Series. Cambridge University Press, 2016.
- [28]R. Trombetti and F. Zullo. On maximum additive Hermitian rank-metric codes. Journal of Algebraic Combinatorics, 54(1):151–171, 2021.arxiv.org/abs/2001.06628
- [29]R. H. Villarreal. Monomial Algebras. Monographs and Research Notes in Mathematics. Chapman & Hall/CRC, Boca Raton, FL, third edition, 2026.