On generalized Lucas sequences

Transcription

1 Contemporary Mathematics On generalized Lucas sequences Qiang Wang This paper is dedicated to Professor G. B. Khosrovshahi on the occasion of his 70th birthday and to IPM on its 0th birthday. Abstract. We introduce the notions of unsigned and signed generalized Lucas sequences and prove certain polynomial recurrence relations on their characteristic polynomials. We also characterize when these characteristic polynomials are irreducible polynomials over a finite field. Moreover, we obtain the explicit expressions of the remainders of Dickson polynomials of the first kind divided by the characteristic polynomial of generalized Lucas sequences. Using these remainders, we show an application of generalized Lucas sequences in the characterization of a class of permutation polynomials and their compositional inverses.. Introduction Fibonacci numbers form an integer sequence 0,,,, 3, 5, 8, 3,, 34, 55,... which was well known in ancient India. To the western world, it became popular through the Italian Mathematician, Leonardo of Pisa known as Fibonacci (70-50), who considered the growth of an idealized (biologically unrealistic) rabbit population by using this sequence in his famous book Liber Abaci (0). In the language of recurrence relation, Fibonacci numbers {F n } n0 satisfy a second order homogeneous recurrence relation given by F 0 0, F, F n F n + F n for n. The so-called Lucas numbers {L n } n0 have the same recurrence relation but different initial values, that is, L 0, L, L n L n + L n for n. 99 Mathematics Subject Classification. Primary B39; Secondary T06. Key words and phrases. Lucas sequences, finite fields, Dickson polynomials, irreducible polynomials, permutation polynomials. Research of the author was partially supported by NSERC of Canada. The author wants to thank Hadi Kharaghani for kind and continuous support, and generous hospitality during the visit to IPM. The author also wants to thank IPM, Behruz Tayfeh-Rezaie, and Saieed Akbari for their warm hospitality. Finally the author thanks the referee for helpful suggestions. c 0000 (copyright holder)

2 QIANG WANG Nowadays, Lucas sequences are referred as a family of sequences with the similar structure. For a given pair of integers P, Q such that P 4Q is a nonsquare, there are two types of Lucas sequences. The first type is usually denoted by {V n (P, Q)} n0 where V 0 (P, Q), V (P, Q) P, V n (P, Q) P V n (P, Q) QV n (P, Q) for n. The second type of sequences {U n (P, Q)} n0 is defined via U 0 (P, Q) 0, U (P, Q), U n (P, Q) P U n (P, Q) QU n (P, Q) for n. We call {V n (P, Q)} n0 the first type because we will see that they can be obtained from Dickson polynomials of the first kind. Similarly, the sequence {U n (P, Q)} n0 can be obtained from Dickson polynomials of the second kind. Hence Fibonacci numbers and Lucas numbers are {U n (, )} n0 and {V n (, )} n0 respectively. When P and Q, sequences {U n (, )} n0 and {V n (, )} n0 are called Pell numbers and Pell-Lucas numbers respectively. It is well-known that L n V n (, ) a n + b n where a + 5 and b 5. Let η be a primitive 0-th root of unity, then we can rewrite a η + η, b η 3 + η 3, and thus L n (η + η ) n + (η 3 + η 3 ) n. Hence this motivated us to introduce the following generalized notion of Lucas numbers in our previous work. Definition.. ([4]) For any integer k and η a fixed primitive (4k + )- th root of unity, the generalized Lucas sequence (or unsigned generalized Lucas sequence) of order k is defined as {a n } n0 such that a n t t odd (η t + η t ) n (( ) t+ (η t + η t )) n. We note that the Lucas numbers are simply generalized Lucas sequences of order k. Similarly, we can define t Definition.. For any integer k and η a fixed primitive (4k + )-th root of unity, the signed (or alternating) generalized Lucas sequence of order k is defined as {b n } n0 such that b n t t even (η t + η t ) n (( ) t (η t + η t )) n. In fact, we will see that all the coefficients of both characteristic polynomials of signed and unsigned generalized Lucas sequences of order k are integers and then using Waring s formula we can conclude that both sequences are integer sequences. Several examples of these families of integer sequences can be found in Sloan s On- Line Encyclopedia of Integer Sequences. For example, generalized Lucas sequence of order 4 is called an accelerator sequence for Catalan s constant (A094649). Similarly, the signed generalized sequences of order 3 and 5 are numbered as A and A respectively. The following tables (Table, Table ) contain initial values and recurrence relations of unsigned and signed generalized Lucas sequence of order k for small k s. t

3 ON GENERALIZED LUCAS SEQUENCES 3 Table. Generalized Lucas sequences k initial values recurrence relations k a n+ a n k, a n+ a n+ + a n k 3 3,, 5 a n+3 a n+ + a n+ a n k 4 4,, 7, 4 a n+4 a n+3 + 3a n+ a n+ a n k 5 5,, 9, 4, 5 a n+5 a n+4 + 4a n+3 3a n+ 3a n+ + a n Table. Signed generalized Lucas sequences k initial values recurrence relations k b n+ b n k, b n+ b n+ + b n k 3 3,, 5 b n+3 b n+ + b n+ + b n k 4 4,, 7, 4 b n+4 b n+3 + 3b n+ + b n+ b n k 5 5,, 9, 4, 5 b n+5 b n+4 + 4b n+3 + 3b n+ 3b n+ b n It is easy to see from the definition that the characteristic polynomial of generalized Lucas sequence of order k is g k (x) k t t odd (x (η t + η t )). Similarly, the characteristic polynomial of signed generalized Lucas sequence of order k is f k (x) k t t even (x (η t + η t )). It is easy to see that f (x) x +, f (x) x + x, g (x) x, and g (x) x x. By convention, we let f 0 (x) g 0 (x). In Section, we show that both characteristic polynomials of degree k satisfy interesting recurrence relations with characteristic polynomials of degree k and k (Theorem., Theorem.). Namely, (.) f 0 (x), f (x) x +, f k (x) xf k (x) f k (x) for k and (.) g 0 (x), g (x) x, g k (x) xg k (x) g k (x) for k. These polynomial recurrence relations provide us an easy way to compute characteristic polynomials of the generalized Lucas sequences and signed generalized Lucas sequences even for large k. Hence it is quite fast to generate unsigned and signed generalized Lucas sequences. Moreover, we characterize when degree k polynomials

4 4 QIANG WANG f k (x) and g k (x) are irreducible polynomials over a finite field F q. It turns out that k + must be prime (Theorem.5). In Section 3, we use some divisibility properties of characteristic polynomials g k (x) to obtain the explicit expressions for the remainders R n,k (x) of Dickson polynomials D n (x) of the first kind divided by g k (x) (Theorem 3.). As an application, we explain the connection between generalized Lucas sequences over a prime field, R n,k (x), and a class of permutation polynomials and their inverses over an extension field (Theorem 3.3 and Theorem 3.8, respectively).. Characteristic polynomials For any integer n and a parameter a in a field F, we recall that the Dickson polynomial of the first kind D n (x, a) F[x] of degree n is defined by D n (x, a) n/ n n i ( n i i ) ( a) i x n i. Similarly, the Dickson polynomial of the second kind E n (x, a) F[x] of degree n is defined by n/ ( ) n i E n (x, a) ( a) i x n i. i For a 0, we write x y +a/y with y 0 an indeterminate. Then the Dickson polynomials can often be rewritten (also referred as functional expression) as ( D n (x, a) D n y + a ) y, a y n + an y n, and E n (x, a) E n ( y + a y, a ) yn+ a n+ /y n+, y a/y for y ± a; For y ± a, we have E n ( a, a) (n+)( a) n and E n ( a, a) (n + )( a) n. It is well known that D n (x, a) xd n (x, a) ad n (x, a) and E n (x, a) xe n (x, a) ae n (x, a) for any n. Here we also note that V n (P, Q) D n (P, Q) and U n+ (P, Q) E n (P, Q). In the case a, we denote Dickson polynomials of degree n of the first and the second kind by D n (x) and E n (x) respectively. It is well known that these Dickson polynomials are closely related to the Chebyshev polynomials by the connections D n (x) T n (x) and E n (x) U n (x), where T n (x) and U n (x) are Chebyshev polynomials of degree n of the first and the second kind, respectively. More information on Dickson polynomials can be found in []. For any k, let η be a primitive (4k + )-th root of unity. It is well known that η t + η t with t k are all the roots of E k (x). Hence the characteristic polynomials f k (x) and g k (x) of signed and unsigned generalized Lucas sequences are both factors of E k (x). In fact, E k (x) f k (x)g k (x) because all three polynomials are monic. Next we prove the following results on the polynomial recurrence relations on the characteristic polynomials f k (x) and g k (x).

5 ON GENERALIZED LUCAS SEQUENCES 5 Theorem.. Let g k (x) k t t odd (x (η t + η t )) be the characteristic polynomial of generalized Lucas sequence of order k and g 0 (x). Then (i) g k (x) E k (x) E k (x) for k. (ii) g k (x) satisfies the following recurrence relation: g 0 (x), g (x) x, g k (x) xg k (x) g k (x) for k. (iii) The generating function of the above recurrence is G(x; t) ( k i (iv) g k (x) ( ) i ) i x k i. t xt+t. Proof. Let G k (x) E k (x) E k (x) for k. Using the functional expression E k (y + y ) yk+ y (k+) y y, we can easily obtain G k (y + y ) y(k+) + y k (y+). In particular, let η be a primitive (4k + )-th root of unity. Hence η k+ and thus G k (η t + η t ) η(k+)t + η tk (η t +) 0 for all odd t. Hence all the roots of g k(x) are roots of G k (x). Moreover, deg(g k (x)) deg(g k (x)) k and both G k (x) and g k (x) are monic, we conclude that (i) is satisfied. Using the recurrence relation E k (x) xe k (x) E k (x), one obtains (ii) immediately. Moreover, the generating function G(x; t) of g k (x) can be derived from ( xt + t )G(x; t) ( xt + t ) k0 g k (x)t k k0 g k (x)t k xg k (x)t k+ + g k (x)t k+ k0 + (x )t xt + t. Finally, to prove (iv), we have g k (x) E k (x) E k (x) k/ j0 i even ( ) j ( k j j k0 (g k+ (x) xg k+ (x) + g k (x))t k+ k0 ) (k )/ x k j j0 ( ) n i/ ( ) i/ x k i i/ ( ) i/ ( k i/ i/ ) x k i. ( ) j ( k j j i odd ) x k j ( ) k i/ ( ) i/ x k i i/ Similarly, we have the following result for signed generalized Lucas sequences.

6 6 QIANG WANG Theorem.. Let f k (x) k t t even (x (η t + η t )) be the characteristic polynomial of signed generalized Lucas sequence of order k and f 0 (x). Then (i) f k (x) E k (x) + E k (x) for k. (ii) f k (x) satisfies the following recurrence relation: f 0 (x), f (x) x +, f k (x) xf k (x) f k (x) for k. (iii) The generating function of the above recurrence is F (x; t) +t ( k i (iv) f k (x) ( ) i ) i x k i. xt+t. y k (y ). Proof. Let F k (x) E k (x) + E k (x) for k. Using the functional expression of E n (x), we can easily obtain F k (y + y ) y(k+) In particular, let η be a primitive (4k + )-th root of unity. Hence η k+ and thus F k (η t + η t ) η(k+)t 0 for all even t. Hence all the roots of f η tk (η t ) k (x) are roots of F k (x). Moreover, deg(f k (x)) deg(f k (x)) k and both F k (x) and f k (x) are monic. Hence we conclude that (i) is satisfied. Using the recurrence relation E k (x) xe k (x) E k (x), one obtains (ii) immediately. Moreover, the generating function F (x; t) of f k (x) can be derived from ( xt + t )F (x; t) ( xt + t ) f k (x)t k k0 k0 f k (x)t k xf k (x)t k+ + f k (x)t k+ k0 + (x + )t xt + + t. Finally, to prove (iv), we have f k (x) E k (x) + E k (x) k/ j0 i even ( ) j ( k j j k0 (f k+ (x) xf k+ (x) + f k (x))t k+ k0 ) (k )/ x k j + j0 ( ) k i/ ( ) i/ x k i + i/ ( ) i/ ( k i/ i/ ) x k i. ( ) j ( k j j i odd ) x k j ( ) k i/ ( ) i/ x k i i/ The functional expressions of f k (x) and g k (x) are quite useful in the above proofs. We summarize them as follows: (.) f k (y+y ) yk+ y k (y ) for y 0, ±, f k() k+, and f k ( ) ( ) k ;

7 ON GENERALIZED LUCAS SEQUENCES 7 and (.) g k (y + y ) yk+ + y k (y + ) for y 0, ±, g k(), and g k ( ) ( ) k (k + ). Using these functional expressions, one can also easily obtain the following result (see also Exercise. in []). Corollary.3. Let f k (x) and g k (x) be characteristic polynomials of signed and unsigned generalized Lucas sequences of order k. Then we have (i) f m+n (x) f m (x)e n (x) f m (x)e n (x). (ii) g m+n (x) g m (x)e n (x) g m (x)e n (x). (iii) If (d + ) (k + ) then f d (x) f k (x) and g d (x) g k (x). Next we will see some applications of E k (x) f k (x)g k (x). First, using E k (x) f k (x)g k (x), Theorem. and Theorem., it is obvious to obtain the following interesting combinatorial identity for any 0 m k. ( k i ( ) i ( k j )( ) j ) { 0 if m is odd; i j ( ( ) m k m) m if m is even. i,j0 i+jm Now we can characterize when f k (x) and g k (x) are irreducible polynomials over a finite field. Let F q be a finite field with char(f q ) p. Since the factorization of E k (x) over a finite field F q is well known (see for example, [6] or [8]), we can obtain the factorization of f k (x) and g k (x) over F q as well. Of course, it is enough to give the result for the case that gcd(k +, p). Indeed, if (k +) p r (t+) where gcd(t +, p), then it is straightforward to obtain f k (x) f t (x) pr (x ) pr and g k (x) g t (x) pr (x + ) pr by using the functional expressions of f k (x) and g k (x). Theorem.4. Let F q be a finite field with char(f q ) p, gcd(k +, p), and φ be Euler s totient function. (i) If q is even, then f k (x) g k (x) is a product of irreducible polynomials in F q [x] which occur in cliques corresponding to the divisors d of k + with d >. To each such d there correspond φ(d)/k d irreducible factors, each of which has the form k d (x (ζ qi d + ζ qi d )). where ζ d is a primitive d-th root of unity and k d is the least positive integer such that q k d ± (mod d). (ii) If q is odd, then f k (x) is a product of irreducible polynomials in F q [x] which occur in cliques corresponding to the odd divisors d of 4k + with d >. To each such d there correspond φ(d)/k d irreducible factors, each of which has the form k d (x (ζ qi d + ζ qi d )). where ζ d is a primitive d-th root of unity and k d is the least positive integer such that q k d ± (mod d).

8 8 QIANG WANG (iii) If q is odd, then g k (x) is a product of irreducible polynomials in F q [x] which occur in cliques corresponding to the even divisors d of 4k + with d >. To each such d there correspond φ(d)/k d irreducible factors, each of which has the form k d (x (ζ qi d + ζ qi d )). where ζ d is a primitive d-th root of unity and k d is the least positive integer such that q k d ± (mod d). Proof. It is easy to see that f k (x) g k (x) for even q. Moreover, if q is odd and d is odd, then ζ d is a even power of a primitive (4k + )-th root of unity. Similarly, if q is odd and d is even then ζ d is an odd power of a primitive (4k +)-th root of unity. The rest of proof follows from [6] or [8]. If k d is the least positive integer such that q k d (mod d), then we say the order of q modulo d is k d which is denoted by ord d (q) k d. Similarly, if k d is the least positive integer such that q k d (mod d), then we say the order of q modulo d is k d which is denoted by ord d (q) k d. Conversely, if ord d (q) k then, by the definition of k d, we can obtain that k d k. However, if ord d (q) k, then k d is not always equal to k. Indeed, if k is even, then k d k ; otherwise, k d k. Now we have the following result which tells us when f k (x) and g k (x) are irreducible polynomials in F q [x]. Theorem.5. Let F q be a finite field with q p m. If either f k (x) or g k (x) is irreducible in F q [x], then k + must be prime. Furthermore, the following are equivalent (i) f k (x) is an irreducible polynomial in F q [x]; (ii) g k (x) is an irreducible polynomial in F q [x]; (iii) k, or ord k+ (q) k, or ord k+ (q) k and k is odd. Proof. First we consider gcd(k +, p). In this case, k + p r (t + ) where r and gcd(t +, p). If f k (x) or g k (x) is irreducible, then t 0 and pr by using the comments before Theorem.4. Hence k and k + 3 is prime. In fact, f (x) and g (x) are linear polynomials and they are always irreducible in F q [x]. Now we assume that gcd(k +, p) and k. If k + is not prime, then there are more than one divisors d of k+ such that d >. Hence by Theorem.4, neither f k (x) nor g k (x) is irreducible in F q [x]. When k + is a prime number, by Theorem.4, there is only one possible choice for d k + when q is even, and only two possible choices for d (i.e., d k + for f k (x) and d 4k + for g k (x)) if q is odd. Hence φ(d) k. Therefore φ(d)/k d if and only if k d k. If q is even, then f k (x) g k (x) is an irreducible polynomial in F q [x] if and only if ord k+ (q) k, or ord k+ (q) k and k is odd. If q is odd, then f k (x) is an irreducible polynomial in F q [x] if and only if ord k+ (q) k, or ord k+ (q) k and k is odd; Similarly, g k (x) is an irreducible polynomial in F q [x] if and only if ord 4k+ (q) k, or ord 4k+ (q) k and k is odd. However, since q is odd, we have (k + ) (q i ± ) if and only if (4k + ) (q i ± ) for any positive integer i. Hence g k (x) is an irreducible polynomial in F q [x] if and only if ord k+ (q) k, or ord k+ (q) k and k is odd.

9 ON GENERALIZED LUCAS SEQUENCES 9 3. Permutation polynomials Let F q be a finite field of q p m elements. In this section, we will explain an application of generalized Lucas sequence over the prime field F p in the characterization of a class of permutation polynomials of F q and their compositional inverses. We recall that a polynomial is a permutation polynomial (PP) of F q if it induces a bijective map from F q onto itself. The study of permutation polynomials of a finite field goes back to 9-th century when Hermite and later Dickson pioneered this area of research. In recent years, interests in permutation polynomials have significantly increased because of their potential applications in cryptography, coding theory, and combinatorics. For more background material on permutation polynomials we refer the reader to Chapter 7 of []. In [0], Lidl and Mullen proposed several open problems and conjectures involving permutation polynomials of finite fields. The following is one of the open problems. Problem 3. (Lidl-Mullen). Determine conditions on k, r, and q so that P (x) x k + ax r permutes F q with a F q. Note that we may assume each polynomial defined over F q has degree at most (q ) because x q x for each x F q. There are many papers on permutation binomials published in the past twenty years. In particular, different types of characterizations were given. We refer the reader to [3], [4], [5], [7], [3], [4], [5], [8], [9], [0], [], [], [3], [4] [5], [6], [8], [9], among others. In this section, we follow the approach from [3], [4], and [6] in terms of generalized Lucas sequences. We will refine a result of the characterization of PPs in [6] by studying the remainders of Dickson polynomials of the first kind divided by the characteristic polynomial of the associated generalized Lucas sequences. First, let us rewrite P (x) x k + ax r x r (x k r + a) and let s gcd(k r, q ) and l q s (here l is called the index of P (x), see []). Then P (x) x r (x es + a) for some e such that (e, l). If a b s for some b F q, then x r (x es + a) is a PP of F q if and only if x r (x es + ) is a PP of F q. Hence we only concentrate on polynomials of the form P (x) x r (x es + ) such that gcd(e, l) from now on. Obviously, q must be odd. Otherwise, P (0) P () 0, a contradiction. It is quite easy to see it is necessary that gcd(r, s), gcd(e, l) and s for P (x) x r (x es + ) to be a PP of F q ([6]). Moreover, gcd(r + es, l). Otherwise, if gcd(r + es, l) d >, then, for a primitive l-th root of unity ζ, (ζ l l d ) r (ζ (l l d )e + ) s ζ l d r ζ l d es (ζ l d e + ) s ζ l d (r+es) ζ l d r (ζ l d e + ) s ζ l d r (ζ l d e + ) s. By Theorem (f) [6] (or Lemma. in [8]), P (x) x r (x es + ) is not a permutation polynomial of F q. Therefore gcd(r + es, l). Now we collect all these necessary conditions for P (x) x r (x es + ) to be a PP as follows: (3.) gcd(r, s), gcd(e, l), gcd(r + es, l), and s. For l 3, the conditions in (3.) are sufficient to determine P (x) is a PP of F q. However, for l 3, it turns out not to be the case (for example, see [3], [4]). For general l, a characterization of PPs of the form x r (x es + ) in terms of generalized Lucas sequence of order k : l is given in [6]. In the following we study

10 0 QIANG WANG the remainders of Dickson polynomials of the first kind divided by characteristic polynomials of generalized Lucas sequences and then improve the result in [6]. Let k and R n,k (x) be the remainder of degree n Dickson polynomial D n (x) of the first kind divided by g k (x). Because all roots of g k (x) are of form η t + η t where t k is odd and η is a fixed primitive (4k + )-th root of unity, it is clear that R 4k++n,k (x) R n,k (x). We now give an explicit description of R n,k (x) for any 0 n 4k + by using certain divisibility properties of g k (x). Theorem 3.. Let k and R n,k (x) be the remainder of degree n Dickson polynomial D n (x) of the first kind divided by g k (x). Then we have D n (x), if 0 n k ; g R n,k (x) k (x), if n k; R k+ n,k (x), if k + n k + ; R 4k+ n,k (x), if k + n 4k + ; Proof. If k, then g (x) x and it is easy to compute directly that R 0, (x), R, (x), R, (x), R 3, (x), R 4, (x), and R 5, (x). Hence the results hold for k. So we assume that k. Because deg(d n (x)) n and deg(g k (x)) k, we have R n,k (x) D n (x) for n k. Next we prove that D k (x) g k (x) + g k (x). We first show that all roots of g k (x) are roots of D k (x) g k (x). Indeed, let θ be a primitive (4k )-th root of unity. Then for any odd t, D k (θ t + θ t ) g k (θ t + θ t ) θ kt + θ kt θkt+ + θ kt (θ t +) θ kt +θ t θ kt (θ t +) 0. Since deg(d k(x) g k (x)) deg(g k (x)) and both D k (x) g k (x) and g k (x) are monic, we have D k (x) g k (x) + g k (x) and thus R k,k (x) g k (x). Now we prove that R n,k (x) R k+ n,k (x) for all k + n k +. Equivalently, we prove that R k+i,k (x) R k i+,k (x) for all i k+, namely, g k (x) (D k+i (x) + D k i+ (x)). Indeed, for any odd t such that t k and a fixed primitive (4k + )-th root of unity η, we have D k+i (η t + η t ) + D k i+ (η t + η t ) η (k+i)t + η (k+i)t + η (k i+)t + η (k i+)t η (k i+)t (η (k+)t + ) + η (k i+)t (η (k+)t + ) 0. Hence all roots of g k (x) are roots of D k+i (x) + D k i+ (x). Similarly we can show that g k (x) (D k++i (x) D k+ i (x)) for all i k and thus R n,k (x) R 4k+ n,k (x) for all k + n 4k +. Table 3 gives a list of R n,k (x) s for small k s. We note that the degree of R n,k (x) is at most k. Any remainder is either a Dickson polynomial of degree k or g k (x) or a negation of the above. Therefore, for the last two columns, we only list the partial information. The rest entries can be found by following the same symmetry pattern as in the first two columns. Let L be left shift operator on the generalized Lucas sequence a (a 0, a,...) (see [9] for more information on LFSR sequences and shift operators). Namely, La (a, a,...). For any f(x) x n c n x n... c 0, we write f(l) L n c n L n... c 0 I where I L 0 such that Ia a. Because g k (x) is a characteristic polynomial of generalized Lucas sequence a, we obtain g k (L)a 0. This means that g k (L)(a i ) 0 for each i 0,,.... Since R n,k (x) is the remainder of degree n Dickson polynomial D n (x) of the first kind divided by g k (x), we also obtain that R n,k (L)a D n (L)a and thus R n,k (L)(a i ) D n (L)(a i ) for each i

11 ON GENERALIZED LUCAS SEQUENCES Table 3. R n,k (x) for small k s R n,k (x) k k 3 k 4 k 5 n 0 n x x x x n x x x x n 3 x + x x x 3 3x x 3 3x n 4 x (x x ) x 3 x x + x 4 4x + n 5 (x ) (x 3 x x + ) x 4 x 3 3x + x + n 6 x x (x 3 3x) (x 4 x 3 3x + x + ) n 7 x + (x ) (x 4 4x + ) n 8 x x x (x 3 3x) n 9 x (x ) (x ) n 0 (x x ) x n x x n x n 3 x 0,,.... Hence we have the following characterization of permutation polynomials of the form x r (x es + ) over F q. Theorem 3.3. Let q p m be an odd prime power and q ls with l 3 and gcd(e, l). Let k : l. Then P (x) xr (x es + ) is a PP of F q if and only if gcd(r, s), gcd(r + es, l), s, and (3.) R jc,k(l)(a cs ) for all c,..., l, where a cs is the cs-th term of the generalized Lucas sequence {a i } of order k over F p, j c c(e φ(l) r + s) mod l, R jc,k(x) is the remainder of Dickson polynomial D jc (x) of the first kind divided by g k (x). In particular, all j c are distinct even numbers between and l. Proof. As we discussed earlier, it is necessary to have gcd(r, s), gcd(r + es, l), and s for P (x) to be a PP of F q. Under these conditions, by Corollary 3 of [6], we have P (x) x r (x es + ) is a PP of F q if and only if (3.3) j c j0 t (jc) j a cs+j, for all c,..., l, where t (jc) j is the coefficient of x j in D jc (x). Moreover, Equation (3.3) is equivalent to D jc (L)(a cs ) for all c,..., l. However, D jc (L)(a cs ) R jc,k(l)(a cs ), hence we are done. Remark 3.4. We emphasize that j c s are all distinct even numbers from and 4k. Since we obtained explicit and simple expressions for R jc,k(x) in Theorem 3., the coefficients of R jc,k(x) can be obtained easily. Moreover, the above result has significant advantage over Corollary 3 in [6] since j c can be as large as 4k while all the degrees of R jc,k(x) are less than k. Abusing the notation t (jc) j, we can rewrite the condition (3.) as (3.4) j t (jc) j a cs+j for all c,..., l

12 QIANG WANG where t (jc) j represents the coefficient of x j in R jc,k(x). Remark 3.5. In [4], we proved that if p (mod l) or p (mod l) and l m then P (x) x r (x es + ) is a PP of F q where q p m if and only if gcd(e, l), gcd(r, s), s, gcd(r + es, l). In particular, in the case that p (mod l) and l m, the condition gcd(r + es, l) is redundant ([]). Furthermore, the period of the generalized Lucas sequence a over F p divides s. Hence in this case, we always have R c,k (L)(k) for all c,,..., l. Finally we consider a related question which is to find the compositional inverse polynomial Q(x) q b ix i of a given permutation polynomial P (x). In 99, Mullen propose the following problem ([6]). Problem 3.6 (Mullen). Compute the coefficients of the inverse polynomial of a permutation polynomial efficiently. It is well-known that s q n Q(s) s F q q s q n s F q q b i s i b i s q +i n b n, s F q for each 0 n q. Since P (x) is a permutation polynomial of F q, b n (P (s)) q n Q(P (s)) sp (s) q n. P (s) F q s F q Set P (x) q n (mod x q x) c 0 + c x c q x q, we have (3.5) b n sp (s) q n q s c i s i c q. s F q s F q Using Equation (3.5), Muratović-Ribić [7] described the inverse polynomial of P (x) x r f(x s ) q s F q [x] recently. In [7], we generalized the result to the inverse polynomials of permutation polynomials of the form x r f(x s ). In particular, for binomials x r (x es +), we have given the following characterization of the inverse in terms of generalized Lucas sequences (Theorem 3. and Equation (5) in [7]). Theorem 3.7. Let p be an odd prime and q p m, l 3 is odd, q ls, and gcd(e, l). If P (x) x r (x es + ) is a permutation polynomial of F q and Q(x) b 0 + b x + + b q x q is the inverse polynomial of P (x) modulo x q x, then there are at most l nonzero coefficients b n. These n s satisfy n r (mod s). Let r r mod s and n c q cs r (l c)s r with c 0,,, l. Then (3.6) b q nc u c l (nc + t (uc) j a nc+j), where u c (cr + r r s )e φ(l) + cs + r mod l, t (uc) j is the coefficient of x j of Dickson polynomial D uc (x) of the first kind, and {a i } is the generalized Lucas sequence of order l. Here we improve this result by replacing D uc (x) with R uc,k(x) where k : l and l q s. j0

13 ON GENERALIZED LUCAS SEQUENCES 3 Theorem 3.8. Let p be an odd prime and q p m, l 3 is odd, q ls, and gcd(e, l). Let k : l. If P (x) xr (x es + ) is a permutation polynomial of F q and Q(x) b 0 + b x b q x q is the inverse polynomial of P (x) modulo x q x, then there are at most l nonzero coefficients b n. These n s satisfy n r (mod s). Let r r mod s and n c q cs r (l c)s r with c 0,,..., l. Then (3.7) b cs+ r l (s r + R uc,k(l)(a nc )), where a nc is the n c -th term of the generalized Lucas sequence {a i } of order k over F p, u c c(re φ(l) + s) + ( r r s )e φ(l) + r mod l, R uc,k(x) is the remainder of Dickson polynomial D uc (x) of the first kind divided by g k (x). Proof. Equation (3.6) in Theorem 3.7 can be rewritten as (3.8) b q nc l (nc + D uc (L)(a nc )). Since D uc (L)(a i ) R uc,k(l)(a i ) and q n c cs + r, we are done. Remark 3.9. Again the advantage of this version over Theorem 3. in [7] is that the degrees of R uc,k(x) are less than k and thus there are much fewer terms involved in the summation of R uc,k(l)(a nc ). We also note that u c s are all distinct odd numbers from to l for c 0,..., l. In particular, if a is periodic with period dividing s, then the above result reduces to Corollary 3.0. Let p be an odd prime and q p m, l 3 is odd, q ls, and gcd(e, l). If P (x) x r (x es + ) is a permutation polynomial of F q and Q(x) b 0 + b x b q x q is the inverse polynomial of P (x) modulo x q x. Assume the period of the generalized Lucas sequence a {a i } l of order k : over F p divides s. Then (3.9) b cs+ r l (s r + R uc,k(l)(a s r )), for c 0,,..., l. where r r mod s, u c c(re φ(l) + s) + ( r r s )e φ(l) + r mod l, R uc,k(x) is the remainder of Dickson polynomial D uc (x) of the first kind divided by g k (x). Example 3.. Let l 3 and gcd(e, 3). In this case, k and g (x) x. So {a i } is the constant sequence,,.... Moreover, by Theorem 3., we have R, (x) and R 4, (x). Hence R, (L)(a cs ) R 4, (L)(a cs ) a cs is automatically satisfied. Therefore, by Theorem 3.3, binomial x r (x es + ) is a PP of F q iff gcd(r, s), gcd(r + es, 3), and s. Again, by Theorem 3., we obtain that R, (x), R 3, (x), R 5, (x). Let r r mod s and u c c(re + s) + r r s e + r. Then we have { R uc,(l)(a s r ) as r, if u c, 5; a s r, if u c 3. Moreover, by Theorem 3.8, we obtain { b cs+ r (s r 3 + ), if u c, 5; (s r 3 ), if u c 3.

14 4 QIANG WANG Example 3.. Let l 5 and gcd(e, 5). In this case, we have that k, g (x) x x and {a i } is the ordinary Lucas sequence. It is easy to see from Theorem 3. that R, (x) x, R 4, (x) x, R 6, (x) x, and R 8, (x) x. Hence { acs+ a R jc,(l)(a cs ) cs, if j c, 8; a cs+, if j c 4, 6. Under the conditions gcd(r, s), gcd(e, 5), gcd(r+es, 5), and s, we obtain from Theorem 3.3 that R jc,(l)(a cs ) iff either a s+ a s a 4s+ a 4s and a s+ a 3s+ or a s+ a s a 3s+ a 3s and a s+ a 4s+. By a useful property of Lucas sequence, i.e., a m a n a m+n + ( ) n a m n (in particular, a n a n + ( ) n ), we can easily deduce that R jc,(l)(a cs ) iff a s. In particular, {a n } is s-periodic (see Lemma 6 in [5]). Moreover, we obtain from Theorem 3. that R, (x) x, R 3, (x) x, R 5, (x), R 7, (x) x, and R 9, (x) x. Let r r mod s and u c c(re 3 + s) + r r s e 3 + r. Therefore R uc,(l)(a s r ) and we obtain from Theorem 3.8 that b cs+ r a s r+, if u c, 9; a s r a s r+, if u c 3, 7; a s r, if u c 5; 5 (s r + a s r+ ), if u c, 9; 5 (s r + a s r a s r+ ), if u c 3, 7; 5 (s r a s r ), if u c 5. Example 3.3. For l 7 and gcd(e, 7), we have that k 3 and g 3 (x) x 3 x x+. We refer the reader to [3] for a complete description of generalized Lucas sequences when P (x) x r (x es + ) is a permutation polynomial of F q. In this case, {a n } n0 is not always s-periodic. By Theorem 3.8 again, the inverse Q(x) of P (x) satisfies b cs+ r 7 (nc + a nc+), if u c, 3; 7 (nc a nc a nc+ + a nc+), if u c 3, ; 7 + a (nc nc a nc+), if u c 5, 9; 7 a (nc nc ), if u c 7; where r r mod s, n c (7 c)s r and u c c(re 5 + s) + r r s e 5 + r mod 4. References [] A. Akbary, S. Alaric, and Q. Wang, On some classes of permutation polynomials, Int. J. Number Theory 4 (008), no., 33 [] A. Akbary, D. Ghioca, and Q. Wang, On permutation polynomials of prescribed shape, Finite Fields Appl. 5 (009), [3] A. Akbary and Q. Wang, On some permutation polynomials, Int. J. Math. Math. Sci., 6 (005), [4] A. Akbary and Q. Wang, A generalized Lucas sequence and permutation binomials, Proc. Amer. Math. Soc., 34 (006), no, 5-. [5] A. Akbary and Q. Wang, On polynomials of the form x r f(x (q )/l ), Int. J. Math. Math. Sci. (007), Art. ID 3408, 7 pp. [6] M. Bhargava and M. E. Zieve, Factorizing Dickson polynomials over finite fields, Finite Fields Appl. 5 (999), 03-. [7] W. S. Chou, Binomial permutations of finite fields, Bull. Austral. Math. Soc. 38 (988),

15 ON GENERALIZED LUCAS SEQUENCES 5 [8] W. S. Chou, The factorization of Dickson polynomials over finite fields, Finite Fields Appl. 3 (997), [9] S. W. Golomb and G. Guang, Signal Design for Good Correlation, Cambridge University Press, 005. [0] R. Lidl and G. L. Mullen, When does a polynomial over a finite field permute the elements of the field? II, Amer. Math. Monthly 00 (993), [] R. Lidl, G. L. Mullen, and G. Turnwald, Dickson polynomials, Longman Scientific and Technical, 993. [] R. Lidl and H. Niederreiter, Finite fields, Encyclopedia of Mathematics and its Applications, Cambridge University Press, 997. [3] A. Masuda, D. Panario, and Q. Wang, The number of permutation binomials over F 4p+ where p and 4p + are primes, Electron. J. Combin. 3 (006), no, Research paper 65, 5pp. [4] A. Masuda and M. E. Zieve, Permutation binomials over finite fields, Trans. Amer. Math. Soc. 36 (009), no. 8, [5] R. A. Mollin and C. Small, On permutation polynomials over finite fields, Internat. J. Math. Math. Sci. 0 (987), no. 3, [6] G. L. Mullen, Permutation polynomials over finite fields, in: Finite fields, Coding Theory, and Advances in Communication and Computing, Las Vegas, NY, 99, pp [7] A. Muratović-Ribić, A note on the coefficients of inverse polynomials, Finite Fields Appl. 3 (007), no. 4, [8] H. G. Park, On certain binomials over finite fields, J. Appl. Math. & Computing 8 (005), no. -, [9] C. Small, Permutation binomials, Internat. J. Math. & Math. Sci. 3 (990), no., [0] C. Small, Arithmetic of finite fields, Monographs and Textbooks in Pure and Applied Mathematics, 48. Marcel Dekker, Inc., New York, 99. [] G. Turnwald, Permutation polynomials of binomial type, Contributions to general algebra 6, [] D. Wan, Permutation polynomials over finite fields, Acta Mathematica Sinica (New Series), Vol. 3, (987), -5. [3] D. Wan, Permutation polynomials over finite fields, Acta Mathematica Sinica (New Series), Vol. 0, (994), [4] D. Wan and R. Lidl, Permutation polynomials of the form x r f(x (q )/d ) and their group structure, Monatsh. Math. (99), [5] L. Wang, On permutation polynomials, Finite Fields and Their Applications 8 (00), 3 3. [6] Q. Wang, Cyclotomic mapping permutation polynomials, Sequences, Subsequences, and Consequences 007 (Los Angeles), Lecture Notes in Computer Science 4893, pp [7] Q. Wang, On inverse permutation polynomials, Finite Fields Appl. 5 (009), [8] M. E. Zieve, Some families of permutation binomials over finite fields, Int. J. Number Theory 4 (008), no. 5, [9] M. E. Zieve, On some permutation polynomials over F q of the form x r h(x (q )/d ), Proc. Amer. Math. Soc. 37 (009), no. 7, School of Mathematics and Statistics, Carleton University, 5 Colonel By Drive, Ottawa, ON KS 5B6, Canada address: wang@math.carleton.ca