WorksMathematics
Counting irreducible skew polynomials
Abstract
We give a counting formula for the coefficients a\in\F_{p^h} for which is irreducible in \F_{p^h}[x;σ], for arbitrary positive integers and , where and is an arbitrary prime power. The proof reduces the problem to quadratic reduced norms, establishes a uniformity statement for every Frobenius generator, and counts the remaining coefficients by Möbius inversion.
Introduction
Throughout, denotes a prime power, not necessarily the characteristic. Let , and let be given by . We study the number of coefficients for which
is irreducible in the skew polynomial ring , whose multiplication is determined by . Our aim is an explicit formula valid for every pair of positive integers , including the case .
The main structural result is a uniformity theorem for quadratic reduced norms on the one-parameter family . Let be any prime power, and let act on , with . If
then for every such that is irreducible,
Here is the explicit quantity defined in (2). Thus the norm map has equally sized fibers over all irreducible quadratics with constant term one, and the same fiber size holds for every generator of . This separates the count of the original coefficients from the arithmetic restrictions on their norm values.
To state the resulting counting formula, put
Writing for the number of irreducible members of the family, we prove
2020 Mathematics Subject Classification. Primary 11T06; Secondary 16S36, 11G20.
Key words and phrases. Finite fields, skew polynomial rings, irreducible polynomials, reduced norms, semilinear maps, Drinfeld curves.
The first author was supported by JSPS KAKENHI Grant Number JP24K00630 and JST COI-NEXT Grant Number JPMJPF2221. The second author was supported by JSPS KAKENHI Grant Number JP25K06959.
The factor is given by
The factor counts coefficients for which is irreducible, has degree over , and is irreducible over for a root of the quadratic. Theorem 2.1 evaluates this factor by an explicit divisor sum. Thus (1) can be evaluated using integer arithmetic, without enumerating the elements of .
For the standard generator, we express the fiber as a twisted Frobenius fixed-point count on the Drinfeld curve
For background on this curve and its group action, see [1 Chapter 2]; the geometric facts and trace calculations needed here are verified in § 4. For a general generator, suitable normal forms for two-dimensional semilinear maps reduce the comparison to power maps having the same image and the same fiber size. Combining this uniformity with the norm reduction and Möbius inversion gives (1).
The distinction from root-count distributions is important here. For the standard Frobenius, the linearized polynomial leads, by for , to the projective polynomial studied in Bluher’s framework [2]. The number of -rational roots of this projective polynomial is the number of -lines in the root space invariant under , where and is the -power Frobenius. This number does not, in general, determine the characteristic polynomial of . Thus an aggregate root-count distribution does not by itself give the count for each prescribed irreducible quadratic norm. Our curve argument keeps track of that characteristic polynomial.
Skew polynomial rings were introduced by Ore [3] and provide an algebraic setting for division, factorization, and semilinear operators. For finite coefficient fields, Caruso and Le Borgne identify reduced norms with characteristic polynomials of iterated companion semilinear maps and characterize irreducibility through the norm [4 Lemma 2.1.15 and Proposition 2.1.17]. Pumplün and Thompson [5] study reduced norms and their relation to reducibility for a broader class of skew polynomial rings. For more general Ore extensions, Churchill and Zhang [6] obtain irreducibility criteria using noncommutative valuations. In the finite-field setting considered here, the reduced-norm criterion provides the structural reduction. To obtain an exact coefficient count, one must additionally determine the fibers of the norm on the prescribed family and impose the conditions arising from power substitution. It is this restricted fiber count that is supplied by the uniformity theorem above.
Odoni [7 Theorem 1] counts all irreducible additive polynomials of a given degree under composition, using the corresponding skew polynomial ring and its central quotients. Such a total count does not determine how many irreducible elements have specified coefficients or a prescribed sparse form. Our family fixes the leading and constant coefficients at one and allows only the term between them. The passage from total enumeration to this constrained count requires the norm fibers on that family. Factorization algorithms over finite fields were developed by Giesbrecht [8] and improved by Caruso and Le Borgne [4]. Skew polynomial rings also occur in the construction of skew-cyclic codes [9]; a survey of the ring-theoretic and coding-theoretic background is given in [10].
A motivation for the prescribed family comes from the second author’s study of self-adjoint irreducible polynomials in skew Laurent polynomial rings over finite fields [11]. That work determines the complete fiber-size distribution of for arbitrary positive integers [11 Corollary 3.12], by combining Bluher’s root-counting results [2] with a second-moment argument based on point counts on Edixhoven curves. In particular, [11 Corollary 5.11] gives the number of monic self-adjoint irreducible Laurent polynomials of degree two, equivalently the total number of irreducible polynomials , with as in (2):
The same work also gives the total degree-two count for arbitrary Frobenius powers [11 Corollary 4.3]. The present paper refines these total counts by prescribing each irreducible quadratic reduced norm and proving independence of the Frobenius generator for the individual fibers. These refined counts allow us to impose the exact-degree and power-substitution conditions needed to treat for all . For this same sparse family, [11 Corollary 4.2] gives an upper bound by excluding coefficients that admit a factorization . Here we obtain the exact count by imposing necessary and sufficient conditions for irreducibility. The general higher-degree bound in [11 Proposition 6.8] concerns the larger family of self-adjoint Laurent polynomials. Indeed, multiplication on the left by gives
Since is a bijection of , and passing from the polynomial ring to the Laurent ring preserves irreducibility for polynomials with nonzero constant term, our count is equivalently an exact count of the self-adjoint irreducible Laurent polynomials , with .
A further motivation for counting self-adjoint irreducible Laurent polynomials comes from their connection with primitive local Galois representations. In the construction of [12], irreducibility of an associated additive polynomial under composition gives a sufficient condition for the resulting representation to be primitive [12 Corollary 3.28(3)].
The arithmetic part is related to the classical enumeration of self-reciprocal irreducible polynomials over finite fields. Meyn and Götz Meyn and Götz [13] give a Möbius-inversion proof of that enumeration and describe its relation to the groups of roots of unity of order . In our setting, a root of an irreducible quadratic satisfies
This connects exact-degree conditions on the coefficient with self-reciprocal polynomials. The remaining power-substitution condition is expressed by the usual finite-field irreducibility criterion for ; see, for example, [14 Theorem 3.75].
When , Corollary 7.1 gives
where and denotes the number of monic self-reciprocal irreducible polynomials of degree over . The identity is explained in § 7; see [13]. This identifies the classical self-reciprocal count inside the formula and isolates the extension factor . The specializations are made explicit at the end of the paper. If is a power of two, the formula also gives whenever .
Generative AI assistance was used in formulating the conjecture for general , exploring and developing proof arguments, and preparing the exposition. It was also used to develop code for supplementary numerical checks, which are not used in the proofs. Further details are provided in the declaration at the end of the paper.
The paper is organized as follows. § 2 states the arithmetic formula. § 3 reduces irreducibility to a quadratic norm and a binomial condition. § 4 and § 5 establish the fiber count for the standard and arbitrary Frobenius generators, respectively. § 6 completes the arithmetic count and proves the main theorem. § 7 records its specializations.
Statement of the formula
Let be a prime power, , and put
Set
For any prime power define
Write , with . If is even or , define . Otherwise set
Empty products are 1; in particular when . Here and denote the Möbius and Euler functions, is the product of the distinct prime divisors of , and denotes the -adic valuation.
Theorem 2.1. With the preceding notation,
The two factors in the formula have different roles. The factor counts the quadratic norm coefficients that satisfy the irreducibility conditions obtained in § 3. For each such , the factor counts the coefficients having that norm coefficient. Thus the proof separates into an arithmetic count of admissible norm coefficients and a uniform count of their preimages. The latter is established in § 4 and § 5, and the two counts are combined in § 6.
We fix our convention for reduced norms. Let be a finite field, let have order , and put
The center of is , and its central localization
is a central simple algebra of degree over . For , we write
Here the reduced norm is defined by extending scalars to a splitting field, identifying the resulting algebra with a matrix algebra, and taking the determinant. Concretely, is a left -vector space with basis . Right multiplication by is -linear, and is the determinant of its matrix in this basis. We always specify the central variable when comparing reduced norms in different skew polynomial rings.
We record explicitly how the determinant convention relates to companion semilinear maps. This is the even-degree form of the standard norm identity and irreducibility criterion; compare [4 Lemma 2.1.15 and Proposition 2.1.17]. Let be monic of even degree with . On the left -vector space
left multiplication by induces a -semilinear map . In the basis its coefficient matrix is the companion matrix , with last column . In particular,
as a -linear map. With , we have
Verification of the conventions and criterion. View as a free left -module with basis . Right multiplication by is injective and has cokernel . Smith normal form over shows that its determinant, up to a nonzero constant, is the characteristic polynomial of multiplication by on , namely that of . The leading coefficient of this determinant is : its leading term comes from right multiplication by , and the matrix for right multiplication by has determinant . More explicitly, a determinant term formed from monomials of degrees has -degree ; degree requires all . Since is even, the leading coefficient is one. This proves the displayed identity, including the order of the twisted matrix product.
For completeness, the same determinant calculation gives for any nonzero skew polynomial . Multiplicativity therefore shows that an irreducible norm forces to be irreducible. Conversely, if is irreducible, is a simple -module. Its central annihilator is generated by an irreducible polynomial ; this follows since the image of the center in the endomorphism division ring of is a finite integral domain. As , is invertible, so . Put and . The central quotient is a central simple algebra of degree over the finite field , hence is ; see also [4 Theorem 2.1.2 and Corollary 2.1.3]. Its simple module has -dimension . Comparing -dimensions gives , hence . Since annihilates , and the characteristic polynomial of belongs to , all its irreducible factors over equal . Equality of degrees and monicity therefore give .
For , this calculation uses exactly
Each factor has determinant one. All reduced norms below use the indicated central variable.
Reduction to a quadratic norm
The aim of this section is to replace irreducibility in the original skew polynomial ring by three conditions over finite fields. We first express the reduced norm in terms of a quadratic polynomial with coefficient . We then show that irreducibility is equivalent to the irreducibility of this quadratic, an exact-degree condition on , and the irreducibility of a binomial over . These are precisely the conditions used later to count the admissible values of .
Put and consider the subrings
Both automorphisms on have order and fixed field . The corresponding central variables satisfy
The inclusions and the corresponding centers can be summarized as
| ring | center | central variable |
Table 1.
The passage from to substitutes ; the passage from to the original ring takes the product of the coefficient conjugates over . The next lemma makes these two operations precise.
For , define by
This norm has the stated shape: the companion matrix is
and the -fold iterate of the associated semilinear map is -linear with determinant one. Its characteristic polynomial therefore has degree two and constant term one.
Lemma 3.1. In the original skew polynomial ring,
Proof. Step 1: compare the norms in and . We claim that
Indeed, extend the center of the cyclic algebra obtained by centrally localizing from to by . The map fixes and sends to ; it respects the skew relation because for . It identifies the resulting cyclic algebra with that of . Indeed, since , choose integers with . After localization, and are invertible, since and are nonzero elements of the respective centers' fraction fields. Thus negative exponents are allowed, and the image contains . The map is therefore surjective. Both algebras have dimension over , so the map is an isomorphism. Reduced norms commute with extension of the center, including inseparable extensions. This proves the first assertion as an identity of rational functions and hence of polynomials.
Step 2: recover the norm in the original ring. Compute this reduced norm using right multiplication in the left -basis . Group the basis vectors according to their exponents modulo . Since all exponents of are multiples of , the matrix is block diagonal, with blocks of size . The block indexed by is obtained from the matrix over by applying to its coefficients. Its determinant is . Multiplying the block determinants proves the claim.
Lemma 3.2. For put
Then is irreducible in if and only if
is irreducible over ;
;
for a root of this quadratic, is irreducible over .
Proof. Step 1: determine when is irreducible. If belongs to a proper subfield , , then is a -th power. If the quadratic splits over , taking coefficient norms of its two linear factors gives a factorization of into two polynomials of degree . Thus irreducibility of requires the first two conditions.
Conversely, under those two conditions, shows that contains . The quadratic is irreducible there, so . Hence is the minimal polynomial of .
Step 2: account for the substitution . If is reducible, then substituting in its factors shows that is reducible. Thus it remains to work under the first two conditions. Choose with . Since , the tower formula gives
The polynomial has degree and has as a root. It is therefore irreducible exactly when the left-hand side is , or equivalently when has degree over . This is exactly the irreducibility of .
Uniformity for the standard Frobenius
For this section let be any prime power, let , and use the automorphism . Put
Define by
Proposition 4.1. If is irreducible over , then .
Proof. We first realize the desired fiber count as a fixed-point count on a curve: equation (6) identifies with the number of fixed points of a twisted Frobenius on the Drinfeld curve . We then pass to its smooth projective closure and apply the Grothendieck–Lefschetz fixed-point formula. The key simplification is that the twisted square of Frobenius has only the eigenvalue on first cohomology. Consequently, all the required traces reduce to the two initial cases of an elliptic group element and such an element composed with Frobenius. This gives the explicit value .
Step 1: realize the norm fiber as a fixed-point set. Let denote the coordinatewise -power Frobenius over , and consider the affine Drinfeld curve
over , which admits a natural -action. Define the morphism
Since
expressing in the basis gives
For , we write for the geometric fiber in .
Each geometric fiber of is a simply transitive -set under the action on column vectors. Indeed, let be the root space of
This polynomial is separable and -linear, so is a two-dimensional -vector space. For an ordered basis of , its Moore determinant
is nonzero. The root relation gives , so . Rescaling one basis vector therefore produces a basis with . By (5), the points of are precisely the column vectors arising from these normalized ordered bases of . Any two such bases are related by a unique element of , proving the assertion.
We will also use the identities
The first follows because is defined over . For the second, and give
Choose with characteristic polynomial
For and , we have
Thus belongs to the same fiber as . By simple transitivity, there is a unique such that
Put
Equation (5) gives
Since commutes with , iteration yields
The matrix is invertible because . Consequently, is conjugate to . By the companion description of the reduced norm, its characteristic polynomial is
Matrices in with irreducible characteristic polynomial form one conjugacy class. Their centralizer in is isomorphic to the norm-one subgroup of and therefore has order . For , the identity
shows that
It follows that, in a fiber with , exactly points satisfy , or equivalently . Fibers with contribute no such points.
Conversely, if satisfies , then
Hence , so every fixed point belongs to one of the fibers considered above. Therefore
where the right-hand side denotes the number of geometric fixed points of on . In particular, for this number is , since and hence .
Step 2: compute the action of a twisted square of Frobenius. The smooth projective closure is
The affine curve is identified with the chart via and . The partial derivatives of its defining equation are , , , which have no common projective zero. It is thus a smooth plane curve of degree , with genus . Setting identifies its boundary with . Write and , where is a prime different from the characteristic. Here is the curve morphism raising coordinates to the -th power, and its action on cohomology is the pullback , with Weil eigenvalues of absolute value on . We use the same notation for commuting curve endomorphisms and their pullback actions on cohomology. For and , the map has zero differential, so its fixed points are simple. Its traces on and are and , respectively. Thus the trace formula reads
There are fixed points of on . Indeed, has nonzero solutions. For each such , the equation is a degree- polynomial equation in with nonzero derivative , so it has exactly distinct solutions over . Raising this equation to the -th power and using gives . Subtracting the original equation yields , hence . No solution has . Adding the boundary points gives . The Grothendieck–Lefschetz trace formula gives
To determine the absolute values of its eigenvalues, put . Since commutes with and , we have
By the Weil conjectures for smooth projective curves, every eigenvalue of on has complex absolute value . Hence every eigenvalue of has complex absolute value . There are such eigenvalues, counted with multiplicity, and their sum is . Equality in the triangle inequality therefore forces every eigenvalue of to be . In particular, for every operator commuting with ,
Indeed, after extending the coefficient field to an algebraic closure, the commuting operators and can be simultaneously upper triangularized. Every diagonal entry of is , so the diagonal entries of are times those of . No semisimplicity assumption is needed.
Step 3: obtain the two initial traces. If has irreducible characteristic polynomial, it has no fixed points on . On the affine curve a fixed vector would give eigenvalue one, and on the boundary a fixed point would give an -rational eigenline. Since has order prime to the characteristic and has no fixed points on , the Grothendieck–Lefschetz trace formula gives
and hence . Equation (6) for gives . There are no fixed boundary points, so
Both statements remain true after multiplying by .
Step 4: evaluate the trace for every . Put . Since and all the operators in question commute, we have
The element again has irreducible characteristic polynomial. Hence Step 3 and (7) give trace in the even case and zero in the odd case. The action on the boundary is that of , since Frobenius fixes pointwise; it has no fixed points there. Applying the Grothendieck–Lefschetz formula on therefore gives
Division by in (6) proves the proposition. □
Changing the Frobenius generator
Let and let
For , we may and do assume . Put and . Define by
and set
The purpose of this section is to prove that changing the generator of does not change the fiber sizes over irreducible quadratics. More precisely, we establish the following reduction to § 4.
Proposition 5.1. For any relatively prime to , and any for which is irreducible over ,
For this is already Proposition 4.1; henceforth assume . We first establish the conjugacy classification and normal forms, then express a fiber size as a count of normalized cyclic vectors. Finally, we compare that count with the standard-Frobenius count, using power maps with the same image and the same number of preimages.
Conjugacy and normal forms
In standard coordinates, a -semilinear map has the form , where acts coordinatewise. We call its coefficient matrix. Its iterates satisfy
In particular, is -linear because . A -semilinear map on is said to have determinant one if
Equivalently, the coefficient matrix of has determinant one.
For such that
is irreducible, let denote the set of determinant-one -semilinear maps on for which has characteristic polynomial . Here acts on semilinear maps by conjugation: two maps and are conjugate if
for some .
Equivalently, if and , then
where is obtained by applying to each entry of .
The conjugacy question is a twisted conjugacy problem: it belongs to the framework of Lang–Steinberg theory and Shintani descent; see, for example, [15 Section 2.2] for the correspondence of classes and centralizers. We give an explicit two-dimensional proof to obtain the normal forms used in the counting argument. The classification and centralizer calculation are structural ingredients; the additional task is to count normalized cyclic vectors, or equivalently intersections with the companion family , and compare these counts for different generators.
Lemma 5.2. The set consists of a single -conjugacy class. The centralizer in of any has order .
Proof. We prove the conjugacy assertion in three steps. First, we derive normal forms and use them to show that is nonempty. Second, we show that any two such maps are -conjugate and compute their invertible self-intertwiners. Here an invertible self-intertwiner of means an element satisfying . Finally, we use the determinants of these self-intertwiners to obtain -conjugacy and determine the centralizer in .
Let be a root of in . Then
and .
We classify the semilinear maps in .
Case 1: is even.
Since is even and , the integer is odd. Thus acts on as the -power Frobenius, and in particular
The two eigenvalues of belong to and are distinct. Order the eigenlines so that the first eigenvalue is . The identity and the -semilinearity of show that exchanges these eigenlines: if , then
Choose eigenvectors with
Such a normalization is possible by rescaling one eigenvector. Since is invertible and exchanges the eigenlines, write
Semilinearity now gives
In this determinant-one basis, the coefficient matrix of is . Its determinant is , so . Thus, in the resulting coordinates,
Put
A direct iteration gives
Since generates , iterating this identity times yields
Thus has characteristic polynomial precisely when its eigenvalues are and .
The norm map is surjective, and the map
has image , the group of -st roots of unity in . Consequently, we may choose so that
This proves existence.
Next consider two maps of the form (8), with parameters , whose first eigenvalues agree. Set
The equality of their first eigenvalues gives
hence
It follows that
By Hilbert’s Theorem 90 for the cyclic extension , whose Galois group is generated by , there is such that
Define
The defining equation for gives . The two maps are therefore -conjugate.
Any invertible self-intertwiner of also commutes with . Since is diagonal with distinct eigenvalues, must be diagonal. Writing , the identity is equivalent to
Thus . Since the fixed field of is , the invertible self-intertwiners are exactly
Their determinants are
Hence the determinant map on the self-intertwiner group is the surjective norm
Case 2: is odd.
Put
Since is odd, does not contain . Therefore remains irreducible over .
We may identify the two-dimensional -vector space with so that acts as multiplication by .
Let be the unique even integer satisfying
and put
Then , and fixes pointwise. Moreover,
so generates .
Because commutes with , it commutes with multiplication by . As , the map is -semilinear on the one-dimensional -vector space . Consequently,
for some .
Since generates , iteration gives
Thus the condition for every is equivalent to
We next express the determinant-one condition in these coordinates, before verifying that both conditions on can be satisfied simultaneously. Choose such that ; in characteristic two, take . Define
This is a nondegenerate, alternating, -valued bilinear form on . Indeed, , since is odd, and therefore
Let be an identification for which is multiplication by . The space of alternating -bilinear forms on the two-dimensional space is one-dimensional. Since both forms are nondegenerate, there is such that
Multiplication by satisfies
Choose with , which is possible by surjectivity of the norm, and replace by . The transported determinant form is then exactly . This change preserves the description of as multiplication by , since multiplication by commutes with multiplication by . In these normalized coordinates, write again.
As and commutes with the -power Frobenius, we have
Thus has determinant one if and only if
We now verify that both norm conditions can be satisfied simultaneously.
Let
This is a cyclic group of order . Set
The exponent of is
Since is odd,
Hence
It follows that the image of the norm map on has order
This image is contained in . Therefore
In particular, there exists with
This proves existence.
Suppose now that and have the same -th power. Then
Hilbert’s Theorem 90 gives such that
Multiplication by intertwines and , proving -conjugacy.
Any self-intertwiner commutes with multiplication by . Since , it is therefore -linear and hence is multiplication by some . Commutation with then requires . Consequently, the invertible self-intertwiners are exactly the multiplications by
Their determinants as -linear maps are
where the last equality follows because is odd. Thus, also in this case, the determinant map on the self-intertwiner group is the surjective norm
Passage to
In either case, let intertwine two determinant-one semilinear maps. Taking determinants in the intertwining identity gives
Since the fixed field of is , we have
More explicitly, let and choose with , as established above. Put . In either parity, the determinant map on the self-intertwiner group of is surjective onto . We may therefore choose a -linear self-intertwiner of with . Then
Thus any two elements of are -conjugate. Since the constructions above also prove that this set is nonempty, it is a single -conjugacy class.
In either parity, the self-intertwiner group is isomorphic to , and its determinant map is the norm to . Consequently, its intersection with has order
From norm fibers to cyclic vectors
For , put
We claim that
Proof. Let . If , then is a determinant-one basis of . Since is -semilinear and has determinant one, there is a unique such that
Indeed, write . The determinant-one condition gives
so ; setting gives the assertion. Thus, relative to the basis , the map has coefficient matrix
The -linear map has characteristic polynomial
Since this polynomial is , we obtain .
Conversely, if , the semilinear map belongs to and hence is -conjugate to .
The determinant-one bases that identify with form a torsor under the centralizer of in . More explicitly, if is one such basis matrix, then all the others are uniquely of the form with , where denotes this centralizer. There are therefore exactly such bases.
Each such basis is uniquely determined by its first vector , since the second vector is .
It follows that
which proves (11).
Comparison with the standard Frobenius
Proof of Proposition 5.1. By Lemma 5.2, it suffices to compare the cyclic-vector counts for and a standard-Frobenius map such that both and have characteristic polynomial .
Case 1: is even.
Use the normal form (8):
Define the standard-Frobenius semilinear map
Since is odd, the action of on is the -power Frobenius. Consequently, both and have eigenvalues
Thus and .
Their cyclic-vector equations are respectively
and
Since is odd and , the standard gcd identity for powers gives
The multiplicative group is cyclic. Therefore the power maps
have the same kernel size, namely , and hence the same image. Moreover, every nonzero element of their common image has exactly preimages under either map, while zero has exactly one preimage. It follows that the two cyclic-vector equations have the same number of solutions.
Case 2: is odd.
We identify the two-dimensional -vector space with the quadratic extension . We retain the notation
Use the normal form (9), with the normalized alternating form :
Define
Because is odd, is even and
Thus generates , and its restriction to is the standard -power Frobenius.
Both and are multiplication by . Furthermore, both maps have determinant one with respect to , because .
Put
Since is even and is odd, is odd. Also
so
For , direct calculation gives
where
Here we used
which holds because .
For , the same calculation gives
Since is odd and , we have
Consequently, the power maps
on have the same image and the same kernel size . As in the even case, zero has a unique preimage under either power map. Thus, for every , the numbers of solutions of
are equal.
Since the cyclic-vector conditions for and are respectively
with and , their numbers of solutions coincide.
In both cases, the cyclic-vector count for the generator agrees with that for the standard Frobenius.
By Lemma 5.2,
Proposition 4.1 gives
and the assertion follows.
Remark 5.3. The fiber counts satisfy , since each has exactly one norm coefficient. There are irreducible quadratics , where is zero for even and one for odd . Consequently, the total contribution of irreducible norm values is , and that of reducible norm values is . The proposition concerns the individual fibers over irreducible norm values.
Arithmetic count and conclusion
We now count the admissible norm coefficients. These satisfy the three conditions of Lemma 3.2. We do this by counting roots in the norm-one group
The binomial irreducibility criterion imposes conditions on the prime parts of , and Möbius inversion selects the elements of exact degree over . Finally, we divide by two because and give the same coefficient . This yields ; multiplying by the common fiber size from § 5 completes the proof of the main theorem.
Proof. The first two conditions are equivalent to choosing
and setting . Each corresponds to exactly two such elements, and . They are distinct, since an element equal to its inverse has degree one over .
If is even, is a square in : this is automatic in characteristic two, while for odd one has . Writing , we obtain
so is reducible. This proves the assertion in this case.
Suppose is odd. The finite-field binomial criterion [14 Theorem 3.75] says that is irreducible if and only if every prime divides but does not divide ; the additional condition for multiples of four is irrelevant here. Since and , this is exactly
For , the binomial is linear and this condition is empty. In particular, implies that there are no such elements.
Assume and let be as in (3). For each , the group
is cyclic of order . It contains no elements satisfying (12) unless .
Suppose . For each prime , the -primary component of this cyclic group has order . The proportion of elements whose orders have maximal -part is . The conditions for distinct primes are independent under the decomposition into primary components. Hence the number of elements satisfying (12) is
If , then if and only if . For , the indicator that its degree over is exactly equals
Summing this indicator over the elements satisfying (12), and dividing by two for inversion, gives
as required. □
Proof of Theorem 2.1. By Lemmas 3.1 and 3.2, the admissible norm coefficients are precisely the elements counted in Lemma 6.1. On the automorphism is , with . Proposition 5.1, applied with and , shows that each admissible coefficient has exactly preimages. Multiplication yields the asserted formula. □
Specializations
Recall that for even and for odd . For the arithmetic count simplifies to
One direct derivation is as follows. Put
The coefficients of irreducible quadratics over are precisely the values with and , each obtained from exactly two such elements. The group has elements, of which satisfy . Hence the number of these quadratics is . An irreducible quadratic over a subfield remains irreducible precisely under an extension of odd degree. Partitioning coefficients by their exact degree gives ; Möbius inversion gives (13).
Let denote the number of monic self-reciprocal irreducible polynomials of degree over . Then
Indeed, the admissible coefficients counted by correspond to the inverse pairs satisfying
via . The minimal polynomial of such an is self-reciprocal, since is a Frobenius conjugate. Conversely, if is a root of a self-reciprocal irreducible polynomial of degree , inversion permutes its Frobenius orbit and is a nontrivial involution commuting with Frobenius. It must therefore act on that orbit as the -th power of Frobenius, so . Each such polynomial has distinct roots, grouped into inverse pairs. Distinct inverse pairs give distinct values of , since their elements are precisely the roots of . Thus each polynomial contributes exactly coefficients to , proving (14). Combining (13) and (14) recovers the classical enumeration of monic self-reciprocal irreducible polynomials; see [13 Theorem 3].
Corollary 7.1. For all ,
If is a power of two, then
In particular, this includes the counting formulas for and .
Proof. If , then
Theorem 2.1 therefore gives
Equation (14) gives the expression in terms of . For a power of two, implies that is even, so the count is zero by Theorem 2.1. If , the sum in (13) for has only the odd divisor , which gives the stated formula. □
Corollary 7.2. For ,
Proof. If , then , . The arithmetic count vanishes unless . In that case the norm-one group has elements, and precisely have maximal -part in their order. These elements have degree two, since the elements of the norm-one group in have order at most two. Dividing by two gives . If , use . □
Remark 7.3. For an example with , take . Then , , , and
The automorphism in the quadratic reduction is on , a nonstandard Frobenius generator. This illustrates the use of § 5.
Declarations
Competing interests
Competing interests. The authors declare no competing interests.
Data availability
No external datasets were used.
Declaration of generative AI and AI-assisted technologies in the manuscript preparation process
Before using generative AI in this work, the authors had proved the counting formula for by a different method and had formulated conjectures for the cases and based on computations in Python. These computations were performed on the computing cluster at RIKEN iTHEMS. They subsequently used OpenAI’s Codex with the GPT-6.1 Sol model to help formulate the conjectured counting formula for general , explore proof strategies, develop proof arguments, write code for computational checks, and assist with drafting and revising the manuscript. The authors reviewed and edited all AI-assisted material and take full responsibility for the mathematical content, references, and final presentation.
(Tomoya Hayata) Keio University School of Medicine, 4-1-1 Hiyoshi, Kohoku-ku, Yokohama, 223-8521, Japan
(Tomoya Hayata) RIKEN Center for Interdisciplinary Theoretical and Mathematical Sciences (iTHEMS), RIKEN, Wako 351-0198, Japan
Email address: [email protected]
(Takahiro Tsushima) Keio University School of Medicine, 4-1-1 Hiyoshi, Kohoku-ku, Yokohama, 223-8521, Japan
Email address: [email protected]
References
- [1]C. Bonnafé, Representations of SL₂(F_q), Algebra and Applications 13, Springer, 2011, Chapter 2. https://doi.org/10.1007/978-0-85729-157-8_2.
- [2]A. W. Bluher, On x^{q+1} + ax + b, Finite Fields Appl. 10 (2004), 285–305. https://doi.org/10.1016/j.ffa.2003.08.004.
- [3]O. Ore, Theory of non-commutative polynomials, Ann. of Math. (2) 34 (1933), no. 3, 480–508. https://doi.org/10.2307/1968173.
- [4]X. Caruso and J. Le Borgne, A new faster algorithm for factoring skew polynomials over finite fields, J. Symbolic Comput. 79 (2017), 411–443. https://xavier.caruso.ovh/papers/publis/fastfactor.pdf.
- [5]S. Plumpton and D. Thompson, The norm of a skew polynomial, Algebr. Represent. Theory 25 (2022), 869–887. https://doi.org/10.1007/s10468-021-10051-z.
- [6]R. C. Churchill and Y. Zhang, Irreducibility criteria for skew polynomials, J. Algebra 322 (2009), no. 11, 3797–3822. https://doi.org/10.1016/j.jalgebra.2009.08.012.
- [7]R. W. K. Odoni, On additive polynomials over a finite field, Proc. Edinburgh Math. Soc. (2) 42 (1999), no. 1, 1–16. https://doi.org/10.1017/S0013091500019970.
- [8]M. Giesbrecht, Factoring in skew-polynomial rings over finite fields, J. Symbolic Comput. 26 (1998), no. 4, 463–486. https://doi.org/10.1006/jsco.1998.0224.
- [9]D. Boucher, W. Geiselmann and F. Ulmer, Skew-cyclic codes, Appl. Algebra Engrg. Comm. Comput. 18 (2007), 379–389. https://doi.org/10.1007/s00200-007-0043-z.
- [10]H. Gluesing-Luerssen, Introduction to skew-polynomial rings and skew-cyclic codes, in Concise Encyclopedia of Coding Theory, CRC Press, Boca Raton, FL, 2021, pp. 151–180. Preprint available at https://arxiv.org/abs/1902.03516.
- [11]T. Tsushima, The Distribution of x^{pⁿ⁻¹} + x^{pⁿ⁻¹} over Finite Fields and Self-Adjoint Irreducible Polynomials, preprint, version 2, Zenodo, 2026. https://doi.org/10.5281/zenodo.2387833.
- [12]T. Tsushima, Local Galois representations associated to additive polynomials, Manuscripta Math. 174 (2024), no. 3–4, 1151–1182. https://doi.org/10.1007/s00229-024-01550-6.
- [13]H. Meyn and W. Götz, Self-reciprocal polynomials over finite fields, Sém. Lothar. Combin. 21 (1989), Art. B21d, 8 pp. https://www.mat.univie.ac.at/~slc/s/s21meyn.html.
- [14]R. Lidl and H. Niederreiter, Finite Fields, second edition, Encyclopedia of Mathematics and its Applications 20, Cambridge University Press, Cambridge, 1997.
- [15]S. Harper, Totally deranged elements of almost simple groups and invariable generating sets, J. Lond. Math. Soc. (2) 109 (2024), no. 6, e12935. https://doi.org/10.1112/jlms.12935.