Roots of certain polynomials over finite fields
Zhiguo Ding, Michael E. Zieve

TL;DR
This paper explicitly determines the roots of specific polynomials over finite fields, resolving an open problem and a conjecture, and introduces a new approach for analyzing such polynomials.
Contribution
It provides explicit root characterizations for a class of polynomials over finite fields and introduces a novel method for this type of problem.
Findings
Explicit root formulas for polynomials over finite fields.
Resolution of an open problem and a conjecture.
Introduction of a new analytical approach.
Abstract
We determine the roots in F_{q^3} of the polynomial X^{2q^k+1} + X + c for each positive integer k and each c in F_q, where q is a power of 2. We introduce a new approach for this type of question, and we obtain results which are more explicit than the previous results in this area. Our results resolve an open problem and a conjecture of Zheng, Kan, Zhang, Peng, and Li.
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.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · Cooperative Communication and Network Coding
Roots of certain polynomials over finite fields
Zhiguo Ding
Hunan Institute of Traffic Engineering, Hengyang, Hunan 421001 China
and
Michael E. Zieve
Department of Mathematics, University of Michigan, 530 Church Street, Ann Arbor, MI 48109-1043 USA
[email protected] http://www.math.lsa.umich.edu/$\sim$zieve/
Abstract.
We determine the roots in of the polynomial for each positive integer and each , where is a power of . We introduce a new approach for this type of question, and we obtain results which are more explicit than the previous results in this area. Our results resolve an open problem and a conjecture of Zheng, Kan, Zhang, Peng, and Li.
Key words and phrases:
Projective polynomial, finite field
The authors thank Lijing Zheng for sharing a preliminary version of [57], and thank Faruk Göloğlu for valuable correspondence.
{NoHyper}
1. Introduction
In case and are powers of , the roots in of polynomials of the form has attracted much attention. For instance, the number of such roots is studied in [4, 5, 6, 8, 10, 11, 13, 15, 16, 20, 23, 25, 26, 27, 28, 29, 30, 34, 36, 45, 48, 49, 52, 56], and this number has been applied to coding theory [7, 30, 43, 55], APN and related functions in cryptography and combinatorics [3, 5, 8, 9, 16, 33, 41, 48, 51], division rings and combinatorial designs [2, 10, 19, 31, 39, 40, 50, 54, 55], cross-correlation of -sequences [11, 25, 28, 29, 32, 43, 56], dynamics over finite fields [52], non-uniqueness of functional decomposition of polynomials [12, 13], permutation polynomials and rational functions [15, 37, 38, 57], and computation of discrete logarithms in multiplicative groups [17, 18, 20, 22, 23, 24], elliptic curves [21], and Jacobians of algebraic curves [44]. The roots of (rather than just their number) were studied in [14, 15, 27, 34, 35, 36, 46, 47]. In particular, several of the above papers reduce the question of determining the number of roots (or exhibiting the roots) of polynomials of the form to the study of properties of an associated recursively defined sequence of polynomials. In this paper we determine the roots of a certain class of polynomials of this form, obtaining descriptions for both the roots and the number of roots which are much more explicit than those in previous papers. In particular, we find an unexpected connection with Dickson polynomials.
Our results use the following notation:
- •
denotes the trace relative to the field extension ;
- •
for any positive integer , is the Dickson polynomial of the first kind of degree with parameter , which is determined by the functional equation [1, 42].
We first describe the number of roots in certain difficult cases.
Theorem 1.1**.**
Let and be positive integers with , and write and . Pick any such that , and let be the number of roots in of . Then
- (1)
if then ; 2. (2)
if then , where if and only if .
The next result (which is easy) provides further information about roots of the Dickson polynomials occurring in Theorem 1.1.
Proposition 1.2**.**
Let be a positive integer with , and write and . Then
- (1)
the roots of in are the elements where and but ; 2. (2)
* has exactly roots in \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q}\setminus\mathbb{F}_{2}, all of which are in .*
We now exhibit the roots of the polynomials in Theorem 1.1.
Theorem 1.3**.**
With notation as in Theorem 1.1, let be the set of roots in of , and pick elements and such that . Then . Write , and define
[TABLE]
and . Then the are pairwise disjoint sets of size .
- (1)
If and is a cube in then . 2. (2)
If and is not a cube in then for the unique such that . 3. (3)
If then there is a unique for which is a cube in ; this value satisfies the following:
- •
if and then ;
- •
if and then ;
- •
if and then ;
- •
if and then .
For completeness, we also determine the roots in of for all elements not addressed in Theorem 1.1, and also for all integers which are divisible by . These remaining cases are much easier than the above results. See Remark 2.9 (for ), Proposition 2.8 (for ), Corollary 2.7 (for ), and Corollary 4.4 (for ).
We deduce the following consequences of our results for roots of certain related polynomials in and in the set of all -th roots of unity in .
Corollary 1.4**.**
Let where is a positive integer with , and pick any with . Then the polynomial has exactly three roots in .
Corollary 1.5**.**
Let where is a positive integer, and pick any and any with . Then, for any , the polynomial has roots in if and only if , in which case the roots in are the three roots of .
The “odd ” case of Corollary 1.4 proves Conjecture 3.5 of [57]. The case of Corollary 1.5 resolves Open Problem 1 of [57]. Moreover, Corollary 1.5 provides an explicit form of the final condition in each of [57, Thm. 3.2] and [57, Thm. 3.6]; the desire to obtain explicit forms of those results was the original motivation for Open Problem 1 and Conjecture 3.5 of [57]. We note that [57, Prop. 3.4] determines when the polynomial in Corollary 1.4 has three roots in the subfield of in case is odd, and also asserts that the polynomial in Corollary 1.5 has no roots in when , is congruent to or (mod ), and is a cube in . The first assertion in this result is contained in our Proposition 7.3, and the second follows from Corollary 1.5.
Our proofs of the above results are nearly self-contained, and use methods that are quite different from those that have been used previously. In particular, one key to our approach is the study of the rational function . It seems conceivable that our approach might also yield explicit results for other instances of the general problems of either counting or naming the roots in of .
This paper is organized as follows. In the next section we prove some easy preliminary results. Then in Section 3 we provide the notation used in Sections 4–6. In Section 4 we reduce the study of roots in of to the study of roots of three associated degree- polynomials, and in particular we prove Lemma 4.3 which is crucial to our approach. In the next section we prove Theorem 1.1 and Proposition 1.2, and then in Section 6 we prove Theorem 1.3. We conclude the paper in Section 7 by proving refinements of Corollaries 1.4 and 1.5, in which in addition to counting the number of roots of the prescribed polynomials we determine these roots explicitly.
2. Preliminary results
In this section we provide some easy preliminary results.
Lemma 2.1**.**
Let be a unique factorization domain, and let be a nonzero non-unit in . For any positive integers and , the element is a greatest common divisor of and in .
This result is well-known in case , but we will also use it in case . Since we do not know a reference for the latter case, we include the following proof.
Proof.
An element divides both and if and only if the element \alpha\hbox to0.0pt{\hss\overline{\phantom{\rm\alpha}}}:=\alpha+\beta R of the quotient ring satisfies \alpha\hbox to0.0pt{\hss\overline{\phantom{\rm\alpha}}}^{m}=1 and \alpha\hbox to0.0pt{\hss\overline{\phantom{\rm\alpha}}}^{n}=1. This says that the order of \alpha\hbox to0.0pt{\hss\overline{\phantom{\rm\alpha}}} divides both and , or equivalently divides , i.e., \alpha\hbox to0.0pt{\hss\overline{\phantom{\rm\alpha}}}^{\gcd(m,n)}=1. Thus divides both and if and only if divides , which concludes the proof. ∎
We now state a general result about the number of roots in of a polynomial of the form , where is a power of the characteristic of . This result has overlap with [4, Thm. 4.3], [11, Lemma 22], [15, Rmk. 5.14], [16, Lemma III.3], [26, Thm. 1], [30, Lemma 9], and [45, Thm. 8]; we provide a short self-contained proof for the reader’s convenience.
Lemma 2.2**.**
Write and where is prime and and are positive integers. For any , the number of roots in of the polynomial is in . Moreover, if and then this number of roots is in .
Proof.
Suppose is a root of . Then
[TABLE]
so for we have if and only if is a root of . Since , it follows that , where denotes the number of the roots in of a polynomial . Since induces a homomorphism from the additive group of to itself, we have . Since and , we have , so that is in and
[TABLE]
Since induces a homomorphism from to itself, we have . Finally, two applications of Lemma 2.1 yield
[TABLE]
so that . We conclude that . Finally, if then permutes so that , whence . ∎
We will use the following special case of the above result.
Corollary 2.3**.**
Let , and pick any and any positive integer coprime to . Then the number of roots in of the polynomial is in if , and is in otherwise.
Proof.
For and , the value equals if , and equals otherwise. Thus Corollary 2.3 follows from the special case of Lemma 2.2 with and with these values of and . ∎
We also use the following result on factorizations of cubic polynomials over (e.g., cf. [53, Thm. 1]).
Lemma 2.4**.**
Let be a power of , and put where and . Let be the number of distinct roots of in , write for the trace from to , and pick satisfying . Then , and if and only if and only if . Moreover, if then if and only if is a cube in .
Next we describe the roots of in \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{2}.
Lemma 2.5**.**
For any a,e\in\mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{2}^{*} with , the set of roots of in \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{2} is .
Proof.
We simply check that if and then
[TABLE]
Remark 2.6**.**
Lemma 2.4 follows easily from Lemma 2.5, which yields a new proof of Lemma 2.4 that is more elementary than the proof in [53] (which relies on Berlekamp’s characteristic analogue of Stickelberger’s theorem on the parity of the number of irreducible factors of a polynomial over a finite field). Also, since any degree- polynomial over \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{2} may be reduced to one of the forms or by composing with a degree-one polynomial on the right and a scalar multiple on the left, Lemma 2.5 yields a similar description of the roots of any degree- polynomial over \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{2} (and both this description and Lemma 2.5 remain valid if \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{2} is replaced by any algebraically closed field of characteristic ).
We conclude this section by determining the roots in of in some relatively easy cases.
Corollary 2.7**.**
Let , and let be the trace from to . For any with , and any nonnegative integer divisible by , pick with . Let be the set of roots in of . Then , and .
Proof.
For we have , so is the set of roots in of . Thus Lemma 2.4 implies that , and Lemma 2.5 yields the description of . ∎
Proposition 2.8**.**
Let , and pick any such that , where denotes the trace from to . Then has a unique root in for each nonnegative integer . This root is where satisfies and is either or according as is either odd or even.
Proof.
The roots in of are precisely the roots in of . Since , we have , so Lemma 2.4 implies that has a unique root in . Hence the number of roots in of is congruent to mod , so it must be by Corollary 2.3.
It remains to determine the unique root. Pick such that , and write where is as in the result. Then satisfies , which would be [math] if . In order to show that is a root in of , it suffices to show that and . If is odd then , so since we conclude that and thus ; hence and , as required. Now assume is even, so that , and thus . Then is the minimal polynomial of over , so the roots of this polynomial are and , and thus . It follows that
[TABLE]
so that , and also . Thus in each case is in and , as desired. ∎
Remark 2.9**.**
If and are powers of then the roots in of are [math] and , since .
3. Notation
In the next three sections we use the following notation:
- •
is a prescribed positive integer coprime to ,
- •
for some positive integer ,
- •
\mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q} is the algebraic closure of ,
- •
is the trace relative to the field extension ,
- •
satisfies (and after section 4),
- •
is a prescribed element of satisfying (and after section 4),
- •
is a prescribed element of ,
- •
if then (which is only used after section 4),
- •
,
- •
,
- •
,
- •
,
- •
,
- •
for any nonnegative integer ,
- •
is the set of roots in of ,
- •
is the size of ,
- •
for any positive integer , is the Dickson polynomial of the first kind with degree and parameter , which is the unique polynomial in satisfying .
4. From roots of to irreducibility of
In this section we prove the following result, using the notation from Section 3.
Proposition 4.1**.**
Suppose . For and any irreducible degree- polynomial which divides , there is a unique for which is a constant times . Conversely, for , if is irreducible over then divides for a unique .
Although the above result requires , we allow in the first two lemmas below, since we will use these lemmas to resolve the case in Corollary 4.4.
Lemma 4.2**.**
We have
[TABLE]
for some which is coprime to .
Proof.
We compute
[TABLE]
where and . Here and are coprime since is a nonzero constant (or alternately, since \max\bigl{(}\deg(g),\deg(h)\bigr{)}=8=\deg(\rho\circ\rho\circ\rho)). Thus
[TABLE]
where and are coprime, which concludes the proof since . ∎
Lemma 4.3**.**
The following statements hold for each \beta\in\mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q}.
- •
We have and if and only if and .
- •
We have and if and only if and .
- •
We have if and only if and .
Proof.
For we have if and only if , i.e., , or equivalently . For \beta\in\mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q} such that , we have
[TABLE]
so Lemma 4.2 implies that if and only if . Thus the roots \beta\in\mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q} of which satisfy are precisely the elements satisfying , which are the roots in of .
For we have if and only if , which upon taking -th roots becomes . For \beta\in\mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q} such that , we have
[TABLE]
so Lemma 4.2 implies that if and only if . Thus the roots \beta\in\mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q} of which satisfy are precisely the elements satisfying , which are the roots in of .
Finally, for \beta\in\mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q} we have if and only if , in which case is fixed by so that . ∎
We now treat the case .
Corollary 4.4**.**
In case , we have if , and otherwise. Moreover, if then is the set of roots of , and if then is the set of roots of .
Proof.
First suppose that is a root of , so that . By Lemma 4.3 we know that is a root of , which is since . Thus , so that is a primitive -th root of unity and .
Conversely, if then if and only if , or equivalently . Since has order , this says , or equivalently .
If then if and only if , or equivalently , i.e., . Since has order , this says , or equivalently , i.e., .
Since all order- elements in \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q}^{*} are contained in , the result follows. ∎
Lemma 4.5**.**
Suppose . Then , and has nine distinct roots in \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q}. Moreover, fixes each root of , and acts as a -cycle on the roots of for .
Proof.
It is routine to verify that and is a degree- polynomial with no multiple roots, so by Lemma 4.3 we conclude that fixes all roots of but does not fix any roots of when . Moreover, one can check that for each the polynomial divides the numerator of , so that maps each root of to a root of . By Lemma 4.2, the roots of are fixed by , so that induces a -cycle on the roots of for each . ∎
Lemma 4.6**.**
If is irreducible over then does not divide for any .
Proof.
Suppose otherwise. Then divides both and . Thus divides , which is by two applications of Lemma 2.1. But this contradicts irreducibility of . ∎
Remark 4.7**.**
Alternately, Lemma 4.6 may be deduced from Lemma 4.3.
We now prove Proposition 4.1.
Proof of Proposition 4.1.
First let be an irreducible degree- polynomial in which divides for some . Then divides in light of Lemma 4.3. By Lemma 4.5, where the ’s are pairwise coprime. By definition, each is a degree- polynomial in . Since is irreducible over and is odd, we see that is also irreducible over , so there is a unique for which divides , and thus is a constant times . Finally, Lemma 4.6 shows that .
Conversely, pick and suppose that is irreducible over . By Lemma 4.5, divides , and also acts as a -cycle on the roots of . Since the two -cycles on the roots of are induced by the -th power map and the -th power map, it follows that acts on the roots of in the same way as exactly one of these two maps. Then Lemma 4.3 implies that divides for exactly one . ∎
5. Proof of Theorem 1.1
In this section we prove Theorem 1.1. We use the notation from Section 3, in addition to requiring ; since , it follows that . In particular we have .
In light of Proposition 4.1, we first determine how the polynomials factor over .
Lemma 5.1**.**
For any , the polynomial has three distinct roots in if is a cube in , and is irreducible in otherwise.
Proof.
Plainly each is a degree- polynomial in . Write and for the coefficients of and in , respectively. Then has the same number of roots in as does . Here , and we compute
[TABLE]
and
[TABLE]
Write and for the coefficients of the terms of of degrees and [math], respectively, and write . Then
[TABLE]
Note that where , , and . Thus , so that has either zero or three roots in by Lemma 2.4. Then one root of is , and we compute
[TABLE]
Since and are nonzero cubes in , the result follows from Lemma 2.4. ∎
Corollary 5.2**.**
The following hold:
- •
if then either all three polynomials are irreducible over or all three ’s have three distinct roots in ;
- •
If then one of , , and has three distinct roots in and the other two ’s are irreducible over .
Proof.
Note that if and only if , which is equivalent to since the order of mod is . It follows that if and only if is a cube in . Thus if then the three values with are either all cubes in or all non-cubes in , which by Lemma 5.1 says that either all three ’s have three distinct roots in or all three ’s are irreducible over . Henceforth assume . Then is a non-cube in , so that the three values with lie in three distinct cosets of . Hence exactly one of these values is a cube in , so Lemma 5.1 says that exactly one has three distinct roots in while the other two ’s are irreducible over . ∎
We now prove the following variant of Theorem 1.1.
Theorem 5.3**.**
Using the notation of Section 3, where in addition we assume , both of the following hold:
- (1)
if then ; 2. (2)
if then , where if and only if is a cube in .
Moreover, is the set of roots of , where is as follows:
- •
if and is a cube in then ;
- •
if and is not a cube in then for some ;
- •
if then there is a unique for which is a cube in ; if then , and otherwise ;
- •
if then .
Proof.
First suppose that , so that by Corollary 2.3. If is a cube in then has three roots in by Lemma 5.1; since each such root is a root of , the condition implies that and is the set of roots of . If is not a cube in then, by Lemma 5.1 and Corollary 5.2, both and are irreducible over . Since is not a constant multiple of , Proposition 4.1 implies that in this case divides , so that . Since , it follows that , so that , and also that is the set of roots of for some .
Now suppose that for some . Then Corollary 2.3 implies that and . By Lemma 5.1 and Corollary 5.2, there is exactly one for which is a cube in , and then has three distinct roots in while is irreducible over for each . Plainly the roots in of each of and are the roots in of . Thus if then and each have three roots in . But if then Proposition 4.1 implies that and divide . Since is not a constant multiple of , it follows that , whence and . Moreover, we have shown that and are the sets of roots of and , respectively. Henceforth suppose that , so that is irreducible over and thus and have no roots in . By Proposition 4.1, it follows that the roots in of are precisely the roots of , and in addition that .Thus and , and is the set of roots of . ∎
Theorem 1.1 follows from the combination of Theorem 5.3 and the following fact.
Lemma 5.4**.**
The element is a cube in if and only if , where .
Proof.
If is odd then , so , whence so that . If is even then , so that . Thus for any we have , where in addition . Now is a cube in if and only , or equivalently . Since , this says . Since we have , or equivalently . So if and only if where . Thus is a cube in if and only if . But , so that if and only if , which upon squaring yields the equivalent condition . ∎
We conclude this section with a proof of Proposition 1.2.
Proof of Proposition 1.2.
We have if is even and otherwise. Thus , and the hypothesis implies that . Since , the roots of in \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q} are the elements where \zeta\in\mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q}^{*} satisfies , or equivalently . For \zeta\in\mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q}^{*}, plainly is in if and only if . This proves (1). Moreover, if and then so also . If and then so that , whence . Thus every root in \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q} of is in . Finally, if then if and only if , so the number of roots of in \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q}\setminus\mathbb{F}_{2} is . This yields (2), since the integer is either or , and hence equals . ∎
6. Proof of Theorem 1.3
In this section we prove Theorem 1.3. We use the notation from Section 3, where in addition we assume that , so that and . In light of Theorem 5.3, there are two main issues to resolve: first, we must exhibit the roots of each ; and second, in case and is not a cube in , we must determine which of or divides .
We first determine the roots of . We need only do this for , since we determined the roots of in Lemma 2.5.
Lemma 6.1**.**
Define
[TABLE]
Then is the set of roots in \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q} of , for each .
Proof.
We simply check that if then
[TABLE]
and likewise if then
[TABLE]
Now we address the case that and is not a cube in .
Lemma 6.2**.**
Suppose that and is not a cube in . Then divides if and only if .
Proof.
Since , is a cube in , so that and are non-cubes in . Write where , so that .
First assume is even, so that and thus , whence ; since , it follows that for some . Thus , so that . Note that . We compute
[TABLE]
so that if and only if
[TABLE]
It is routine to check that this equality holds if , but if then the sum of the two sides is
[TABLE]
which is nonzero since if and only if , which does not occur since . Thus if and only if , or equivalently .
Next assume is odd, so that , and thus , so . It follows that , and since we conclude that for some . Hence and . Thus
[TABLE]
so we conclude as above that if and only if . Likewise,
[TABLE]
so that if and only if . Hence if and only if , or equivalently .
We have shown that in every case if and only if . Since varies over the three roots of by Lemma 6.1, it follows that if and only if . ∎
Proof of Theorem 1.3.
By Lemma 6.1, the sets and in Theorem 1.3 are the sets of roots in \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q} of and , respectively. Moreover, we have , so that and thus in Corollary 2.5 we may put to conclude that is the set of roots in \mathbb{F}\hbox to0.0pt{\hss\overline{\phantom{\rm\mathbb{F}}}}_{q} of . By Lemma 4.5, the are pairwise disjoint sets of size . Now items (1) and (3) of Theorem 1.3 follow from Theorem 5.3.
Henceforth suppose that and is not a cube in . Then Theorem 5.3 implies that is in . Finally, Lemma 6.2 shows that if and only if , so that also if and only if , which yields item (2) of Theorem 1.3. ∎
7. Proof of the Open Problem and Conjecture of Zheng et al.
In this section we prove refinements of Corollaries 1.4 and 1.5. Throughout this section we use the following notation:
- •
is a prescribed positive integer coprime to ,
- •
for some positive integer ,
- •
is the set of -th roots of unity in ,
- •
is the trace relative to the field extension ,
- •
is a prescribed element of ,
- •
satisfy ,
- •
,
- •
,
- •
,
- •
,
- •
for any nonnegative integer ,
- •
for any nonnegative integer ,
- •
is the set of roots in of .
Lemma 7.1**.**
We have , , and , and the roots of are the products of with each root of .
Proof.
The definitions imply that and . We compute
[TABLE]
so that , whence . Since we have , so the roots of are times the roots of . ∎
The following result generalizes Corollary 1.5.
Proposition 7.2**.**
The polynomial has either zero or three roots in . It has three such roots if and only if , in which case these roots are the three roots of . Explicitly, these roots are the values where varies over the cube roots of .
Proof.
We first show that has no roots in . For, any such root would satisfy and , which yields the contradiction .
By Lemma 7.1, the roots of in are the values where satisfies and . Since , the last condition says , which by definition equals . Since , we know that . Thus the elements consist of the roots of irreducible monic cubic polynomials which divide and have constant term . By Lemma 7.1, the elements and satisfy the hypotheses of Proposition 4.1, so that is a constant times either or . Plainly the ratio of the coefficients of of degrees [math] and is , while the corresponding ratio for is . It follows that has either zero or three roots in , with three roots occurring if and only if is irreducible in and divides , in which case the three roots are the roots of . Lemma 5.1 implies that is irreducible in if and only if . Since the polynomials , , and are pairwise coprime by Lemma 4.5, the combination of Theorem 5.3 and Lemma 6.2 implies that divides if and only if one of the following holds:
- •
and ;
- •
and ;
- •
and .
Since , we have
[TABLE]
Since , we conclude that has three roots in if and only if .
We have shown that if has three roots in then these three roots are the roots of
[TABLE]
By Lemma 6.1, these roots are where , which equals . ∎
Our final result generalizes Corollary 1.4.
Proposition 7.3**.**
Suppose that . Then the set of roots in of satisfies , and is contained in if and only if is a cube in . If then , and is the set of roots of where
- (1)
* if ;* 2. (2)
* if .*
Explicitly, we have
[TABLE]
Proof.
By Lemma 7.1 we have with and . Thus , so Theorem 1.1 implies that .
We now determine . Defining as in Theorem 1.3, that result implies the following:
- (a)
is a cube in if and only if ; 2. (b)
if and is a non-cube in then for the unique such that ; 3. (c)
if and is a non-cube in then there is a unique for which is a cube in , and this satisfies .
We now translate the above conditions on into conditions on . Since , we have
[TABLE]
Thus is a cube in if and only if is a cube, which is equivalent to being a cube since is a cube. If then , so that . If then , so that , and also is a cube in if and only if .
We have shown that is a cube in if and only if . Moreover, if is not a cube in then if and only if , and otherwise. By Lemmas 2.5 and 6.1, for each the set is the set of roots of the polynomial from Section 3. Since plainly every element of is a root of , Proposition 4.1 implies that if and only if . Now the result follows, since the polynomials in items (1) and (2) of Proposition 7.3 are and , respectively, and the three cases in the description of in Proposition 7.3 are for in that order. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. S. Abhyankar, S. D. Cohen, and M. E. Zieve, Bivariate factorizations connecting Dickson polynomials and Galois theory , Trans. Amer. Math. Soc. 352 2871–2887.
- 2[2] D. Bartoli, J. Bierbrauer, G. Kyureghyan, M. Giulietti, S. Marcugini, and F. Pambianco, A family of semifields in characteristic 2 2 2 , J. Algebraic Combin. 45 (2017), 455–473.
- 3[3] C. Blondeau and L. Perrin, More differentially 6 6 6 -uniform power functions , Des. Codes Cryptogr. 73 (2014), 487–505.
- 4[4] A. W. Bluher, On x q + 1 + a x + b superscript 𝑥 𝑞 1 𝑎 𝑥 𝑏 x^{q+1}+ax+b , Finite Fields Appl. 10 (2004), 285–305.
- 5[5] A. W. Bluher, On the existence of Budaghyan–Carlet APN hexanomials , Finite Fields Appl. 24 (2013), 118–123.
- 6[6] A. W. Bluher, A new identity of Dickson polynomials , Finite Fields Appl. 80 (2022), Paper No. 102012, 32 pp.
- 7[7] C. Bracken and T. Helleseth, Triple-error-correcting BCH-like codes , in: 2009 IEEE International Symposium on Information Theory, 1723–1725, 2009.
- 8[8] C. Bracken, C. H. Tan, and Y. Tan, On a class of quadratic polynomials with no zeros and its application to APN functions , Finite Fields Appl. 25 (2014), 26–36.
