on a conjecture on permutation rational functions over finite fields
Abstract.
Let be a prime and be a positive integer, and consider , where is such that . It is known that (i) permutes for and all ; (ii) for and , permutes if and only if ; and (iii) for and , does not permute . It has been conjectured that for and , does not permute . We prove this conjecture for sufficiently large .
Key words and phrases:
finite field, Lang-Weil bound, permutation, rational function2010 Mathematics Subject Classification:
11R58, 11T06, 11T55, 14H051. Background
Let denote the finite field with elements. Polynomials over that permute , called permutation polynomials (PPs) of , have been extensively studied in the theory and applications of finite fields. Recently, permutation rational functions (PRs) of finite fields also attracted considerable attention. There are a number of reasons for studying PRs. Certain types of PPs of high degree can be reduced to PRs of low degree; this approach has allowed people to solve numerous questions about PPs [1, 2, 5, 6, 7, 9, 11, 12, 13, 14, 16]. Oftentimes, PRs reveal phenomena that are not present in PPs; understanding these phenomena requires methods that are different from those in traditional approaches to PPs.
This paper concerns a conjecture on PRs of the type
of , where is a prime, is a positive integer, and is such that . In [15], Yuan et al. proved that for and all , is a PR of . Recently, it was shown in [8] that for and , is not a PR of , and for and , is a PR of if and only if . Based on computer search, it was conjectured in [8] that for and , is not a PR of . We will prove this conjecture for sufficiently large . Our approach relies on the Lang-Weil bound on the number of zeros of absolutely irreducible polynomials over finite fields. The main technical ingredient of our proof is a claim that that a certain polynomial of degree 18 in has a cyclic absolutely irreducible factor in and a claim that a certain polynomial of degree 46 in has a cyclic absolutely irreducible factor in .
Throughout the paper, denotes the algebraic closure of . For , define
is said to be absolutely irreducible if it is irreducible in . The resultant of two polynomials and in is denoted by .
2. Cyclic Shift and the Forbenius
For and , let denote the resulting polynomial by applying to the coefficients of ; this defines an action of on . Let be the cyclic shift on the indeterminates : . For and , let ; this gives an action of on . A polynomial is called cyclic if and is called pseudo-cyclic if for some th unity in .
For , form a normal basis of over if and only if the Moore matrix of ,
is invertible. An matrix over is of the form for some if and only if , where is the Frobenius map of , is the result of entry-wise action of on , and
From this, it is easy to see that if is invertible, then for some .
Lemma 2.1.
Let be such that . Let and . Then
-
(i)
is cyclic if and only if is cyclic;
-
(ii)
and is cyclic if and only if and is cyclic.
Proof.
Since , where , we only have to prove the “only if” part in both (i) and (ii).
(i) () We have
(ii) () We have
∎
3. The Case
For , we have the following theorem.
Theorem 3.1.
Let be a prime and be such that . Then is not a PR of . (Note: is the th prime.)
Proof.
We have
where
Let
It suffices to show that there exists with such that , i.e., such that
(3.1) |
where . The solution of (3.1) for is
(3.2) |
where
(3.3) | ||||
(3.4) | ||||
Therefore, it suffices to show that there exist , with and , satisfying
(3.5) |
Assume for the time being that we already have , with and , that satisfy (3.5). Let and . Then we have
(3.6) | |||
(3.7) | |||
(3.8) | |||
(3.9) |
From (3.9) we can express in terms of , , and through the following calculation:
(3.10) | |||
(3.11) | |||
(3.12) | |||
(3.13) |
provided the denominator is nonzero. Using (3.6) – (3.8), we can write (3.13) as
(3.14) |
where
(3.15) |
(3.16) |
It follows that
(3.17) | |||
(3.18) |
Using (3.14), equation (3.6) becomes
(3.19) |
and using (3.14), (3.17) and (3.18), equation (3.9) becomes
(3.20) |
where is a cyclic polynomial of degree 18. More precisely,
(3.21) |
where is homogeneous of degree :
(3.22) | ||||
(3.23) | ||||
(3.24) | ||||
(3.25) |
We will show that there exists such that but . Once this is done, the proof of the theorem is completed as follows: Clearly, . Let and let be given by (3.14), (3.17) and (3.18). Then (3.6) and (3.9) hold. Let . By (3.9), ; by (3.6), and satisfy (3.5).
Choose such that is invertible and let
By Lemma 3.2 below, has a cyclic absolutely irreducible factor . Let . Then implies that , Lemma 2.1 implies that and is cyclic, and the absolute irreducibility of implies the absolute irreducibility of . The Lang-Weil bound [10] states that
More precisely, by [4, Theorem 5.2],
(3.26) |
We find that
Hence . Let . It follows that . By [4, Lemma 2.2],
(3.27) |
Therefore,
since
Let and let . Then but . The proof is complete. ∎
Lemma 3.2.
The polynomial in (3.21) has a cyclic absolutely irreducible factor in .
Proof.
Let denote the cyclic shift and let be the Frobenius map . Recall that the homogeneous component of the highest degree of is
All pseudo-cyclic factors of in are cyclic; therefore, all pseudo-cyclic factors of in are cyclic.
We have
where
(3.28) |
and
We claim that and are irreducible in . The discriminant of , as a polynomial in , is
Assume to the contrary that is a square in . Then
where and .
When ,
Then , and it follows that
which is a contradiction.
When ,
Then , and it follows that
which is a contradiction.
Write and . Let be irreducible factors of of the form
where . We first claim that . Otherwise, . Since , it follows that , which is a contradiction. In the same way .
Next, we claim that either or is cyclic. Otherwise, and . Then and . We must have . (Otherwise, , whence , which is a contradiction.) If , then . Hence , which is a contradiction. If , then , which is a contradiction. If , i.e., , we have , which is also a contradiction. ∎
4. The Case
The proof for the case is more complicated but is based on the same approach for the case .
Theorem 4.1.
Let be a prime and be such that . Then is not a PR of . (Note: is the th prime.)
Proof.
First, by [8, Conjecture 4.1′], it suffices to show that is not a PR of . We have
where
and
(4.1) |
It suffices to show that there exists with such that . To this end, it suffices show that there exist , with and , satisfying
(4.2) |
Assume that such and exist, and let and , . Then
(4.3) |
where the subscript is taken modulo 4, and
(4.4) |
Under the condition (4.4), one can express in terms of as follows:
Squaring both sides leads to
(4.5) |
provided , where
In the same way,
(4.6) |
The equation
(4.7) |
can be written as
(4.8) |
where
Using (4.6), equation (4.4) becomes
(4.9) |
where
Using (4.3), we can write
where
and
are cyclic polynomials over of degree 46 and 18, respectively, and , . More precisely,
(4.10) |
where is homogeneous of degree :
(4.11) | ||||
(4.12) | ||||
(4.13) | ||||
(4.14) | ||||
(4.15) | ||||
(4.16) | ||||
(4.17) | ||||
(4.18) | ||||
(4.19) |
Later, we will use the fact that
(4.20) |
This fact follows from the computation that
To prove the theorem, it suffice to show that there exists such that but . Once this is done, the proof of the theorem is completed as follows: Clearly, . Let , . Let () be given by (4.6) and in (4.6) let be given by (4.3), whence is defined in terms of . For so defined, (4.8) and (4.9) are satisfied. Let . From (4.8) we have (4.7) and hence (4.2); from (4.9) we have (4.4), i.e., .
Lemma 4.2.
The polynomial in (4.10) has a cyclic absolutely irreducible factor in .
Proof.
Throughout this proof, denotes the cyclic shift and is the Frobenius map . For any , denotes the homogenous component of degree in . For with , let be the homogenization of and let . Since , we have . Therefore, if , then , whence , i.e., .
Let be independent indeterminates and let be a root of . We claim that . Let , in terms of , be given by (4.6) and (4.3). Then (4.3) is satisfied. By (4.3), and it is easy to see that , and are all nonsquares in . It follows that
Hence the claim. (A more general fact which is easily proved by induction: If is a field with and are such that for every , is a nonsquare in , then and .)
.................................................................................................................. |
We claim that has no factors with multiplicity . This claim follows from the following computation:
We claim that if is an irreducible factor of , then . Assume the contrary. Then . Write , where . By , . Note that . It follows that . By , we have , that is, . We have
where
It is easy to see see that and are irreducible in . (The discriminants of and , as polynomials in , are and , respectively. These are nonsquares in .) Therefore does not have any nonconstant factor with nonzero constant term. It follows that . Then
which is a contradiction.
We claim that if is a pseudo-cyclic absolutely irreducible factor of , then is cyclic. We have , where . Let . By , () and hence (). Then . Since and , it follows from (4.11) that
where , , . Thus . If , it follows from that either or divides both and . Then is divisible by or , which is a contradiction.
We claim that cannot be written as , where , are irreducible or equal to . or , and or . Otherwise, by , and , where . Since , we have and , which is impossible.
Let
We may assume that for some irreducible factor of in . Clearly, does not have any nontrivial factor in , so . By , we have . Let be the smallest integer such that .
Case 1. Assume that . Then and we are done.
Case 2. Assume that . We claim that cyclic. Otherwise, by , is not pseudo-cyclic. Then . Since , we have for some , which is impossible by . Hence the claim is proved.
If , then for some , which is impossible by . Hence , i.e., .
Case 3. Assume that . We first claim that for some . Otherwise, . Since , we have for some , which is impossible by . So the claim is proved. Write , where . Since and , we have , so .
Case 3.1. Assume that is cyclic. Since , we have , i.e., .
If , then is a cyclic absolutely irreducible factor of in , and we are done.
If , then for some , which is impossible by .
If , is a cyclic absolutely irreducible factor of in , and we are done.
If , then is cyclic and belongs to . If is absolutely irreducible, we are done. So assume that has a proper absolutely irreducible factor . By the minimality of , we have . If is not pseudo-cyclic, then , whence for some , which is impossible by . Therefore is pseudo-cyclic and hence cyclic (by ). If is not a constant, we have , which leads to the same contradiction. Thus is a constant. We may assume that . Now is a cyclic absolutely irreducible factor of in .
Case 3.2. Assume that is not cyclic. By , is not pseudo-cyclic. Then is a cyclic factor of . We claim that is a constant. (Otherwise, , , and are different factors of . Then for some , which is impossible by .) We may assume that . Let , which is cyclic and belongs to . By , is not a constant. Let be an absolutely irreducible factor of . By the minimality of , . If is not cyclic, then . Thus for some , which is impossible by . So is cyclic. If is not a constant, then , which leads to the same contradiction. So is a constant, and we may assume that . Now is a cyclic absolutely irreducible factor of in .
The proof of the lemma is now complete. ∎
Acknowledgment
The research of D. Bartoli was supported by the Italian National Group for Algebraic and Geometric Structures and their Applications (GNSAGA - INdAM).
References
- [1] D. Bartoli, On a conjecture about a class of permutation trinomials, Finite Fields Appl. 52 (2018), 30 – 50.
- [2] D. Bartoli, Permutation trinomials over , Finite Fields Appl. 61 (2020), Article 101597.
- [3] D. Bartoli and M. Giulietti, Permutation polynomials, fractional polynomials, and algebraic curves, Finite Fields Appl. 51 (2018), 1 – 16.
- [4] A. Cafure and G. Matera, Improved explicit estimates on the number of solutions of equations over a finite field, Finite Fields Appl. 12 (2006), 155 – 185.
- [5] X. Cao, X. Hou, J. Mi, S. Xu, More permutation polynomials with Niho exponents which permute , Finite Fields Appl. 62 (2020), Article 101626.
- [6] X. Hou, On a class of permutation trinomials in characteristic 2, Cryptography and Communications, 11 (2019), 1199 – 1210.
- [7] X. Hou, On the Tu-Zeng Permutation Trinomial of Type , arXiv:1906.07240.
- [8] X. Hou and Sze, On a type of permutation rational functions over finite fields, arXiv:1910.11989.
- [9] X. Hou, Z. Tu, X. Zeng, Determination of a class of permutation trinomials in characteristic three, Finite Fields Appl. 61 (2020), Article 101596.
- [10] S. Lang and A. Weil, Number of points of varieties in finite fields, Amer. J. Math. 76 (1954), 819 – 827.
- [11] K. Li, L. Qu, C. Li, S. Fu, New permutation trinomials constructed from fractional polynomials, Acta Arith. 183 (2018), 101 – 116.
- [12] Z. Tu and X. Zeng, Two classes of permutation trinomials with Niho exponents, Finite Fields Appl. 53 (2018), 99 – 112.
- [13] Z. Tu, X. Zeng, C. Li, T. Helleseth, A class of new permutation trinomials, Finite Fields Appl. 50 (2018), 178 – 195.
- [14] Q. Wang, Polynomials over finite fields: an index approach, In: Combinatorics and Finite Fields, Editors: K-U. Schmidt and A. Winterhof, De Gruyter, 2019, pp. 319 – 348.
- [15] J. Yuan, C. Ding, H. Wang, J. Pieprzyk, Permutation polynomials of the form , Finite Fields Appl. 14 (2008), 482 – 493.
- [16] M. E. Zieve, On some permutation polynomials over of the form , Proc. Amer. Math. Soc. 137 (2009), 2209 – 2216.