The Number of Irreducible Polynomials of Even Degree over F 2 with the First Four Coefficients Given
|
|
- Elisabeth McKenzie
- 5 years ago
- Views:
Transcription
1 The Number of Irreducible Polynomials of Even Degree over F 2 with the First Four Coefficients Given B. Omidi Koma School of Mathematics and Statistics Carleton University bomidi@math.carleton.ca July 22, 2010 B. Omidi Koma () Irreducible Polynomials July 22, / 34
2 1 Introduction Definitions and Background Previous Results 2 Generalizing Möbius Inversion Formula 3 Computing F(n,t 1,t 2,t 3,t 4 ) 4 The Formula For N(n,t 1,t 2,t 3,t 4 ) 5 Cosets of F 2 l in F 2 n 6 An Approximation of N(n,t 1,t 2,t 3,t 4 ) 7 Some Outputs of Our Approximation 8 Future Directions 9 References B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with July Given 22, 2010 Trace and2 Constan / 34
3 Definitions and Background For β F 2 n the k th trace is denoted by T k (β), and defined as T k (β) = β i 1 β i2 β i k. 0 i 1 <i 2 < <i k n 1 F(n,t 1,,t r ) : the number of β F 2 n where T i (β) = t i, 1 i r. Let f (x) = x n + a n 1 x n a 1 x + a 0 be a polynomial of degree n over F 2. a n i is the i th trace of f, written as T i (f ) = a n i, for 1 i n. P(n,t 1,,t r ) : the set of irreducible polynomials of degree n over F 2, where a n i = t i F 2. Let N(n,t 1,,t r ) = P(n,t 1,,t r ). B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with July Given 22, 2010 Trace and3 Constan / 34
4 Previous Results Let N(n,q) be the number of monic irreducible polynomials of degree n over F q [x]. Then q n = dn(n,q). By Möbius inversion formula we have N(n,q) = 1 n ( n ) µ q d = 1 d n µ(d)q n d. The number of irreducible polynomials with the first coefficient prescribed is given by Carlitz (1952). B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with July Given 22, 2010 Trace and4 Constan / 34
5 Let n be an even integer, and a b (mod 4) be shortened to a b. Then Cattell, Miers, Ruskey, Serra, and Sawada, (2003) proved that nn(n,1,0) = µ(d)f(n/d,1,0) + nn(n,1,1) = µ(d)f(n/d,1,1) + µ(d)f(n/d,1,1), µ(d)f(n/d,1,0), nn(n,0,0) = nn(n,0,1) = d odd d odd µ(d)f(n/d,0,0) µ(d)f(n/d,0,1),n/deven d odd,n/deven d odd µ(d)2 n 2d 1, µ(d)2 n 2d 1. B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with July Given 22, 2010 Trace and5 Constan / 34
6 Also F(n,t 1,t 2 ) = 2 n 2 + G(n,t 1,t 2 ), and for n = 2m we have Table: Values of G(n, t 1, t 2 ) m (mod 4) (0, 0) (0, 1) (1,0) (1,1) 0 2 m 1 2 m m 1 2 m m 1 2 m m 1 2 m 1 The number of irreducible polynomials of even degree n over F 2 with given first three coefficients is considered by Yucas and Mullen (2004). For odd degree n Fitzgerald and Yucas (2003) consider the same problem. B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with July Given 22, 2010 Trace and6 Constan / 34
7 Generalizing Möbius Inversion Formula For our study we proved the following generalization of Möbius Inversion. Theorem Suppose a b (mod 8) be written as a b. Let A(n), B(n), C(n), D(n), α(n), β(n), γ(n), and δ(n) be functions defined on N. Then α + X β + X γ + X δ, d d d d d 5 d 7 if and only if A(n) = X B(n) = X C(n) = X D(n) = X β + X d γ + X d δ + X γ d α + X d d 5 δ + X d d 5 δ + X d α + X β d d 5 d 7 d + X d 7 + X α d d 7 γ, d β, d d, B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with July Given 22, 2010 Trace and7 Constan / 34
8 Theorem (Countinued) α(n) = X β(n) = X γ(n) = X δ(n) = X µ(d)a + X µ(d)b + X µ(d)c + X µ(d)d, d d d d d 5 d 7 µ(d)b + X d µ(d)c d + X µ(d)d + X µ(d)c d µ(d)a + X d d 5 µ(d)d + X d d 5 + X µ(d)b d d 5 µ(d)d + X d d 7 µ(d)a + X d d 7 µ(d)c d, µ(d)b, d + X µ(d)a d d 7 d. In general, we proved that when modulo is 2 j, where j > 3, we have 2 j 1 functions in terms of some other 2 j 1 functions. For our case, j = 3. B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with July Given 22, 2010 Trace and8 Constan / 34
9 Computing F(n, t 1, t 2, t 3, t 4 ) Lemma Let β F 2 n and f F 2 [x] of degree n/d be the minimal polynomial of β. Then the i th trace of β is the coefficient of x n i in f d, or T i (β) = T i (f d ), where 1 i n. Lemma Let d 1 be an integer, and f F 2 [x]. Then (i) T 1 (f d ) = dt 1 (f ); ( ) d (ii) T 2 (f d ) = T 1 (f ) + dt 2 (f ); 2 ( ) d (iii) T 3 (f d ) = T 1 (f ) + dt 3 (f ); 3 ( ) ( ) d d (iv) T 4 (f d ) = T 1 (f ) + T 2 (f ) + dt 4 (f ). 4 2 B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with July Given 22, 2010 Trace and9 Constan / 34
10 Lemma Let d be a given integer such that d 1. For 0 j 7 we shorten d j (mod 8) as d j. If f F 2 [x] is a given polynomial, then for 0 j 7 the coefficients T i (f d ) where i = 1,2,3,4 are given in the following table. Table: Different coefficients of f d d i T 1(f d ) T 2(f d ) T 3(f d ) T 4(f d ) d d 1 T 1(f ) T 2(f ) T 3(f ) T 4(f ) d 2 0 T 1(f ) 0 T 2(f ) d 3 T 1(f ) T 1(f ) + T 2(f ) T 1(f ) + T 3(f ) T 2(f ) + T 4(f ) d T 1(f ) d 5 T 1(f ) T 2(f ) T 3(f ) T 1(f ) + T 4(f ) d 6 0 T 1(f ) 0 T 1(f ) + T 2(f ) d 7 T 1(f ) T 1(f ) + T 2(f ) T 1(f ) + T 3(f ) T 1(f ) + T 2(f ) + T 4(f ) B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and10 Constan / 34
11 Theorem Let n be an even positive integer and t i F 2, for 1 i 4. Also let a b (mod 8) be shortened as a b. Then the number of elements β F 2 n with prescribed first four traces T i (β) = t i can be given by F(n,t 1,t 2,t 3,t 4 ) = 7 i=0 d i n d. S i, where the sets S 0,...,S 7 are defined as: S 0 = {f P(n/d) : t i = 0, i = 1,2,3,4}, S 1 = {f P(n/d) : T i (f ) = t i, i = 1,2,3,4}, S 2 = {f P(n/d) : t 1 = t 3 = 0, T 1 (f ) = t 2, T 2 (f ) = t 4 }, B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and11 Constan / 34
12 Theorem (Continued) S 3 = {f P(n/d) : T 1 (f ) = t 1, T 1 (f ) + T i (f ) = t i, i = 2,3, T 2 (f ) + T 4 (f ) = t 4 }, S 4 = {f P(n/d) : t i = 0, i = 1,2,3, T 1 (f ) = t 4 }, S 5 = {f P(n/d) : T i (f ) = t i, i = 1,2,3, T 1 (f ) + T 4 (f ) = t 4 }, S 6 = {f P(n/d) : t 1 = t 3 = 0, T 1 (f ) = t 2, T 1 (f ) + T 2 (f ) = t 4 }, S 7 = {f P(n/d) : T 1 (f ) = t 1, T 1 (f ) + T i (f ) = t i, i = 2,3, T 1 (f ) + T 2 (f ) + T 4 (f ) = t 4 }. We use the last theorem and our generalization of Möbius Inversion formula to find the number N(n,t 1,t 2,t 3,t 4 ). B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and12 Constan / 34
13 The Formula For N(n, t 1, t 2, t 3, t 4 ) Theorem For even degree n, different values of N(n,t 1,t 2,t 3,t 4 ) are given as (i) nn(n,1, 1,1, 0) = X µ(d)f(n/d,1, 1,1, 0) + X + X µ(d)f(n/d,1, 1,1, 1) + X d 5 d 7 nn(n,1, 0,0, 1) = X µ(d)f(n/d,1, 0,0, 1) + X + X µ(d)f(n/d,1, 0,0, 0) + X d 5 d 7 nn(n,1, 1,1, 1) = X µ(d)f(n/d,1, 1,1, 1) + X + X µ(d)f(n/d,1, 1,1, 0) + X d 5 d 7 µ(d)f(n/d,1,0, 0,0) µ(d)f(n/d,1,0, 0,1), µ(d)f(n/d,1,1, 1,0) µ(d)f(n/d,1,1, 1,1), µ(d)f(n/d,1,0, 0,1) µ(d)f(n/d,1,0, 0,0), B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and13 Constan / 34
14 Theorem (Continued) nn(n,1, 0, 0,0) = X µ(d)f(n/d,1,0, 0,0) + X (ii) nn(n,0, 0, 1,0) = X d odd (iii) nn(n,0, 0, 1,1) = X d odd + X µ(d)f(n/d,1,0, 0,1) + X d 5 d 7 µ(d)f (n/d,0,0, 1,0), µ(d)f (n/d,0,0, 1,1), (iv) nn(n,1, 1, 0,0) = X µ(d)f(n/d,1,1, 0,0) + X + X µ(d)f(n/d,1,1, 0,1) + X d 5 d 7 µ(d)f(n/d,1, 1,1, 1) µ(d)f(n/d,1, 1,1, 0), µ(d)f(n/d,1, 0,1, 0) µ(d)f(n/d,1, 0,1, 1), B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and14 Constan / 34
15 Theorem (Continued) nn(n,1, 0,1, 1) = X µ(d)f(n/d,1, 0,1, 1) + X + X µ(d)f(n/d,1, 0,1, 0) + X d 5 d 7 nn(n,1, 1,0, 1) = X µ(d)f(n/d,1, 1,0, 1) + X + X µ(d)f(n/d,1, 1,0, 0) + X d 5 d 7 nn(n,1, 0,1, 0) = X µ(d)f(n/d,1, 0,1, 0) + X + X µ(d)f(n/d,1, 0,1, 1) + X d 5 d 7 µ(d)f(n/d,1,1, 0,0) µ(d)f(n/d,1,1, 0,1), µ(d)f(n/d,1,0, 1,1) µ(d)f(n/d,1,0, 1,0), µ(d)f(n/d,1,1, 0,1) µ(d)f(n/d,1,1, 0,0). B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and15 Constan / 34
16 Theorem (Continued) In the following cases, a b represents a b (mod 4). (v) nn(n,0,1, 1,1) = X µ(d)f(n/d,0,1, 1,1) + X nn(n,0,1, 1,0) = X (vi) nn(n,0,0, 0,0) = X d odd (vii) nn(n,0,0, 0,1) = X d odd µ(d)f(n/d,0,1, 1,0) + X µ(d)f(n/d,0, 0,0, 0) X µ(d)f(n/d,0, 0,0, 1) µ(d)f(n/d,0, 1,1, 0), µ(d)f(n/d,0, 1,1, 1),, d n even d odd X, n d even d odd µ(d)f(n/2d, 0, 0), µ(d)f(n/2d, 0, 0), B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and16 Constan / 34
17 Theorem (Continued) and finally, (viii) nn(n,0, 1,0, 0) = X + X nn(n,0, 1,0, 1) = X + X µ(d)f(n/d,0,1, 0,0) µ(d)f(n/d,0,1, 0,1) µ(d)f(n/d,0,1, 0,1) µ(d)f(n/d,0,1, 0,0) X, d n even X, d n even X, d n even X, n d even µ(d)f(n/2d, 1,0) µ(d)f(n/2d, 1, 1), µ(d)f(n/2d, 1,1) µ(d)f(n/2d, 1, 0). B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and17 Constan / 34
18 Theorem (Continued) and finally, (viii) nn(n,0, 1,0, 0) = X + X nn(n,0, 1,0, 1) = X + X µ(d)f(n/d,0,1, 0,0) µ(d)f(n/d,0,1, 0,1) µ(d)f(n/d,0,1, 0,1) µ(d)f(n/d,0,1, 0,0) X, d n even X, d n even X, d n even X, n d even µ(d)f(n/2d, 1,0) µ(d)f(n/2d, 1, 1), µ(d)f(n/2d, 1,1) µ(d)f(n/2d, 1, 0). B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and18 Constan / 34
19 Cosets of F 2 l in F 2 n Let n = 4l. For a given α F 2 l the linear functional L α : F 2 l F 2 is defined as L α (β) = T 2 l(αβ), for all β F 2 l. We define W 0 = Ker(T 2 l) = {β F 2 l T 2 l(β) = 0}, and W i (γ) = {β F 2 l T i (β + γ) = T i (β) + T i (γ)}, for i = 1,...,4. For γ F 2 n there exist three possibilities for W i (γ), where i = 2,3,4. Either W i (γ) = F 2 l, or W i (γ) = W 0, or W i (γ) is a hyperplane different that W 0. In total there exist 27 different cases. We proved that some of these cases are possible. We divide them into three groups, based on W 2. B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and19 Constan / 34
20 Table: Group one, W 2 (γ) = F 2 l W 3 W 4 F 2 l W 0 W 3 W 0, F 2 l F 2 l Cat A N/A N/A W 0 Cat A 1 N/A N/A W 4 W 0, F 2 l Cat A 2 N/A N/A Table: Group two, W 2 (γ) = W 0 W 3 W 4 F 2 l W 0 W 3 W 0, F 2 l F 2 l N/A N/A N/A W 0 Cat B 1 Cat C 1 N/A W 4 W 0, F 2 l Cat B 2 Cat C 2 N/A B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and20 Constan / 34
21 Table: Group three, W 2 (γ) W 0, F 2 l W 3 W 4 F 2 l W 0 W 3 W 0, F 2 l F 2 l N/A N/A N/A W 0 Cat F 1 Cat D 1 Cat E 1 W 4 W 0, F 2 l Cat F 2 Cat D 2 Cat E 2 For each category we have some conditions on γ F 2 n. For example, a coset γ + F 2 l is in D 1 iff ˆγ = γ + γ 2l + γ 22l + γ 23l 1 and either (i) T 2 l(ˆγ) = 0 and ˆγ 4 = ˆγ + 1, or (ii) T 2 l(ˆγ) = 1 and ˆγ 4 = ˆγ 2 + ˆγ + 1. B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and21 Constan / 34
22 For γ F 2 n the coset γ + F 2 l is in one of the 13 categories. Then we can compute different traces of an element γ + β from the coset γ + F 2 l, where β F 2 l. For example if the coset γ + F 2 l is in category D 1, the traces of an element γ + β are given in the following table. Table: Traces in Category D 1 T i(β + γ) T 1(β + γ) β F 2 l T 2(β + γ) T 3(β + γ) T 4(β + γ) β W 2 W 0 T 1(γ) T 2(γ) T 3(γ) T 4(γ) β W 2 \ (W 2 W 0) T 1(γ) T 2(γ) T 3(γ) + 1 T 4(γ) β W 0 \ (W 2 W 0) T 1(γ) T 2(γ) + 1 T 3(γ) T 4(γ) β F 2 l \ (W 2 W 0) T 1(γ) T 2(γ) + 1 T 3(γ) + 1 T 4(γ) B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and22 Constan / 34
23 In different categories T i (γ + β), 1 i 4, is in terms of T i (γ), which is either zero or one. To complete the study, we need to know in each category for how many of the elements γ we have T i (γ) = 0, and T i (γ) = 1. We expect that T i (γ) depends on m, or l, where n = 2m = 4l. Once the conditions are obtained one is able to compute the the exact value of N(n,t 1,t 2,t 3,t 4 ), where n = 4l. Similar results to these studies are then needed for the case n = 4l + 2. B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and23 Constan / 34
24 An Approximation of N(n, t 1, t 2, t 3, t 4 ) We have 16 cases for (t 1,t 2,t 3,t 4 ). In our main theorem these 16 cases are divided to 8 groups, and each group has some of the cases of (t 1,t 2,t 3,t 4 ) that are connected to each other. Then for different groups the formulas for the number N(n,t 1,t 2,t 3,t 4 ) are given in terms of F(n/d,t 1,t 2,t 3,t 4 ) s where d n, and (t 1,t 2,t 3,t 4 ) is from the same group as (t 1,t 2,t 3,t 4 ). Assume that F(n/d,t 1,t 2,t 3,t 4) = { 2 n d 4 if n d 4, 0 otherwise. B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and24 Constan / 34
25 We let n = 2 k 0 k1 p 1 p k s s, where k 0,...,k s 1, and p 1,...,p s are odd prime divisors of n. Assume that S 1 = {p 1,...,p s }, and for 2 q s let S q = {d : d n,d is the product of exactly q distinct odd primes p i S 1 } For the first 12 cases of (t 1,t 2,t 3,t 4 ) which are in groups (i) to (v), the number N(n,t 1,t 2,t 3,t 4 ) can be given as N(n,t 1,t 2,t 3,t 4 ) = 1 2 n 4 + n s [n/d 4]( 1) q 2 n/d 4. d S q q=1 B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and25 Constan / 34
26 For (t 1,t 2,t 3,t 4 ) from groups (vi) we have (t 1,t 2,t 3,t 4 ) = (0,0,0,0) and N(n,0,0,0,0) = 1 s 2 n 4 + [n/d 4]( 1) q 2 n/d 4 n q=1 d S q 1 s (F(n/d,0,0) + ( 1) q F(n/2d,0,0). n q=1 d S q In group (vii) we have (t 1,t 2,t 3,t 4 ) = (0,0,0,1) and N(n,0,0,0,1) = 1 s 2 n 4 + [n/d 4]( 1) q 2 n/d 4 n q=1 d S q 1 s (F(n/d,0,1) + ( 1) q F(n/2d,0,1). n q=1 d S q B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and26 Constan / 34
27 Finally in group (viii), if (t 1,t 2,t 3,t 4 ) = (0,1,0,0) then the estimate for N(n,t 1,t 2,t 3,t 4 ) can be given as 1 s 2 n 4 + ( 1) q [n/d 4]2 n/d 4 F(n/2,1,0) n q=1 d S q 1 s ( 1) q ([d 1]F(n/2d,1,0) + [d 3]F(n/2d,1,1)), n q=1 d S q and if (t 1,t 2,t 3,t 4 ) = (0,1,0,1) the estimate for N(n,t 1,t 2,t 3,t 4 ) is 1 s 2 n 4 + ( 1) q [n/d 4]2 n/d 4 F(n/2,1,1) n q=1 d S q 1 s ( 1) q ([d 1]F(n/2d,1,1) + [d 3]F(n/2d,1,0)). n q=1 d S q B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and27 Constan / 34
28 Table: Different values of N(16, t 1, t 2, t 3, t 4 ), where t i = 0, 1. Case No. (t 1,t 2, t 3,t 4) our estimate N(16, t 1,t 2,t 3,t 4) 1 (1, 1, 1, 0) (1, 0, 0, 1) (1, 1, 1, 1) (1, 0, 0, 0) (0, 0, 1, 0) (0, 0, 1, 1) (1, 1, 0, 0) (1, 0, 1, 1) (1, 1, 0, 1) (1, 0, 1, 0) (0, 1, 1, 1) (0, 1, 1, 0) (0, 0, 0, 0) (0, 0, 0, 1) (0, 1, 0, 0) (0, 1, 0, 1) Total B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and28 Constan / 34
29 Table: Different values of N(18, t 1, t 2, t 3, t 4 ), where t i = 0, 1. Case No. (t 1,t 2, t 3,t 4) our estimate N(18, t 1,t 2,t 3,t 4) 1 (1, 1, 1, 0) (1, 0, 0, 1) (1, 1, 1, 1) (1, 0, 0, 0) (0, 0, 1, 0) (0, 0, 1, 1) (1, 1, 0, 0) (1, 0, 1, 1) (1, 1, 0, 1) (1, 0, 1, 0) (0, 1, 1, 1) (0, 1, 1, 0) (0, 0, 0, 0) (0, 0, 0, 1) (0, 1, 0, 0) (0, 1, 0, 1) Total B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and29 Constan / 34
30 Future Directions (1) A natural way to extend this problem is completing the counting argument to find N(n,t 1,t 2,t 3,t 4 ). (2) Studying the number N(n,t 1,t 2,t 3,t 4 ), where n is an odd number. (3) Change the finite field to a general field F q (4) Studying the number N(n,t 1,...,t k ), where 4 k n. B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and30 Constan / 34
31 Thank You B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and31 Constan / 34
32 References L. Carlitz, A theorem of Dickson on irreducible polynomials, Proc. Amer. Math. Soc., 3 (1952), K. Cattell, C. R. Miers, F. Ruskey, M. Serra and J. Sawada, The number of irreducible polynomials over GF(2) with given trace and subtrace, J. Combin. Math. Combin. Comput., 47 (2003), S. D. Cohen, Explicit theorems on generator polynomials, Finite Fields and Their Applications, 11 (2005), S. D. Cohen, M. Presern, Primitive polynomials with prescribed second coefficient, Glasgow Mathematical Journal Trust, 48 (2006), S. D. Cohen, Primitive elements and polynomials with arbitrary trace, Journal of American Mathematics Society, 83 (1990), 1???7. B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and32 Constan / 34
33 R. W. Fitzgerald and J. L. Yucas, Irreducible polynomials over GF(2) with three prescribed coefficients, Finite Fields and Their Applications, 9 (2003), E. N. Kuz???min, On a class of irreducible polynomials over a finite field, Dokl. Akad. Nauk SSSr 313 (3) (1990), (Russian: English translation in Soviet Math. Dokl. 42(1) (1991), ) R. Lidl and H. Niederreiter, Finite Fields, Cambridge Univ. Press, Cambridge, second edition, M. Moisio, Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm. Acta Artith., to appear M. Moisio and K. Ranto, Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients prescribed, Finite Fields and Their Applications, 14 (2008), B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and33 Constan / 34
34 J.L. Yucas, Irreducible polynomials over finite fields with prescribed trace/prescribed constant term. Finite Fields and Their Applications, 12 (2006), J. L. Yucas and G. L. Mullen, Irreducible polynomials over GF(2) with prescribed coefficients, Discrete Mathematics, 274 (2004), D. Wan, Generators and irreducible polynomials over finite fields. Math. Comp., 219 (1997), B. Omidi Koma () The Number of Irreducible Polynomials of Degree n over F q with JulyGiven 22, 2010 Trace and34 Constan / 34
How Are Irreducible and Primitive Polynomials Distributed overjuly Finite 21, Fields? / 28
How Are Irreducible and Primitive Polynomials Distributed over Finite Fields? Gary L. Mullen Penn State University mullen@math.psu.edu July 21, 2010 How Are Irreducible and Primitive Polynomials Distributed
More informationSome fundamental contributions of Gary Mullen to finite fields
Some fundamental contributions of Gary Mullen to finite fields School of Mathematics and Statistics, Carleton University daniel@math.carleton.ca Carleton Finite Fields Day 2017 September 29, 2017 Overview
More informationPermutation Polynomials over Finite Fields
Permutation Polynomials over Finite Fields Omar Kihel Brock University 1 Finite Fields 2 How to Construct a Finite Field 3 Permutation Polynomials 4 Characterization of PP Finite Fields Let p be a prime.
More informationHAMMING DISTANCE FROM IRREDUCIBLE POLYNOMIALS OVER F Introduction and Motivation
HAMMING DISTANCE FROM IRREDUCIBLE POLYNOMIALS OVER F 2 GILBERT LEE, FRANK RUSKEY, AND AARON WILLIAMS Abstract. We study the Hamming distance from polynomials to classes of polynomials that share certain
More informationSelf-reciprocal Polynomials Over Finite Fields
Self-reciprocal Polynomials Over Finite Fields by Helmut Meyn 1 and Werner Götz 1 Abstract. The reciprocal f (x) of a polynomial f(x) of degree n is defined by f (x) = x n f(1/x). A polynomial is called
More informationTopological groups with dense compactly generated subgroups
Applied General Topology c Universidad Politécnica de Valencia Volume 3, No. 1, 2002 pp. 85 89 Topological groups with dense compactly generated subgroups Hiroshi Fujita and Dmitri Shakhmatov Abstract.
More informationON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE
ON PERMUTATION POLYNOMIALS OF PRESCRIBED SHAPE AMIR AKBARY, DRAGOS GHIOCA, AND QIANG WANG Abstract. We count permutation polynomials of F q which are sums of m + 2 monomials of prescribed degrees. This
More informationMethods for primitive and normal polynomials
Methods for primitive and normal polynomials Stephen D Cohen University of Glasgow Fields-Carleton Finite Fields Workshop Ottawa, 21 July, 2010 Preliminaries Throughout F q is the finite field of cardinality
More informationA Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.6. A Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve Ömer Küçüksakallı Mathematics Department Middle East
More informationA PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY
A PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY I. HECKENBERGER AND J. SAWADA Abstract. A bound resembling Pascal s identity is presented for binary necklaces with fixed density using
More informationPencils of Quadratic Forms over Finite Fields
Southern Illinois University Carbondale OpenSIUC Articles and Preprints Department of Mathematics 2004 Pencils of Quadratic Forms over Finite Fields Robert W. Fitzgerald Southern Illinois University Carbondale,
More informationSomething about normal bases over finite fields
Something about normal bases over finite fields David Thomson Carleton University dthomson@math.carleton.ca WCNT, December 17, 2013 Existence and properties of k-normal elements over finite fields David
More informationExplicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields
Southern Illinois University Carbondale OpenSIUC Articles and Preprints Department of Mathematics 2007 Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields Robert W. Fitzgerald
More informationZsigmondy s Theorem. Lola Thompson. August 11, Dartmouth College. Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, / 1
Zsigmondy s Theorem Lola Thompson Dartmouth College August 11, 2009 Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, 2009 1 / 1 Introduction Definition o(a modp) := the multiplicative order
More informationGENERATORS OF FINITE FIELDS WITH POWERS OF TRACE ZERO AND CYCLOTOMIC FUNCTION FIELDS. 1. Introduction
GENERATORS OF FINITE FIELDS WITH POWERS OF TRACE ZERO AND CYCLOTOMIC FUNCTION FIELDS JOSÉ FELIPE VOLOCH Abstract. Using the relation between the problem of counting irreducible polynomials over finite
More informationDICKSON POLYNOMIALS OVER FINITE FIELDS. n n i. i ( a) i x n 2i. y, a = yn+1 a n+1 /y n+1
DICKSON POLYNOMIALS OVER FINITE FIELDS QIANG WANG AND JOSEPH L. YUCAS Abstract. In this paper we introduce the notion of Dickson polynomials of the k + 1)-th kind over finite fields F p m and study basic
More informationKloosterman sum identities and low-weight codewords in a cyclic code with two zeros
Finite Fields and Their Applications 13 2007) 922 935 http://www.elsevier.com/locate/ffa Kloosterman sum identities and low-weight codewords in a cyclic code with two zeros Marko Moisio a, Kalle Ranto
More informationGENERATION OF PRIMITIVE BINARY POLYNOMIALS
INTERNATIONAL CONFERENCE ON ALGEBRA, LOGIC AND DISCRETE MATHEMATICS April 14-16, 1995 Niš GENERATION OF PRIMITIVE BINARY POLYNOMIALS Miodrag Živković Let F q denote the finite field of order q = p n, where
More informationGENERATING SERIES FOR IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS
GENERATING SERIES FOR IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS ARNAUD BODIN Abstract. We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results
More informationThe Degree of the Splitting Field of a Random Polynomial over a Finite Field
The Degree of the Splitting Field of a Random Polynomial over a Finite Field John D. Dixon and Daniel Panario School of Mathematics and Statistics Carleton University, Ottawa, Canada fjdixon,danielg@math.carleton.ca
More informationOn generalized Lucas sequences
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.
More informationR. Popovych (Nat. Univ. Lviv Polytechnic )
UDC 512.624 R. Popovych (Nat. Univ. Lviv Polytechnic ) SHARPENING OF THE EXPLICIT LOWER BOUNDS ON THE ORDER OF ELEMENTS IN FINITE FIELD EXTENSIONS BASED ON CYCLOTOMIC POLYNOMIALS ПІДСИЛЕННЯ ЯВНИХ НИЖНІХ
More informationCHARACTERIZING INTEGERS AMONG RATIONAL NUMBERS WITH A UNIVERSAL-EXISTENTIAL FORMULA
CHARACTERIZING INTEGERS AMONG RATIONAL NUMBERS WITH A UNIVERSAL-EXISTENTIAL FORMULA BJORN POONEN Abstract. We prove that Z in definable in Q by a formula with 2 universal quantifiers followed by 7 existential
More informationϕ : Z F : ϕ(t) = t 1 =
1. Finite Fields The first examples of finite fields are quotient fields of the ring of integers Z: let t > 1 and define Z /t = Z/(tZ) to be the ring of congruence classes of integers modulo t: in practical
More informationNOTES Edited by William Adkins. On Goldbach s Conjecture for Integer Polynomials
NOTES Edited by William Adkins On Goldbach s Conjecture for Integer Polynomials Filip Saidak 1. INTRODUCTION. We give a short proof of the fact that every monic polynomial f (x) in Z[x] can be written
More informationON VALUES OF CYCLOTOMIC POLYNOMIALS. V
Math. J. Okayama Univ. 45 (2003), 29 36 ON VALUES OF CYCLOTOMIC POLYNOMIALS. V Dedicated to emeritus professor Kazuo Kishimoto on his seventieth birthday Kaoru MOTOSE In this paper, using properties of
More informationGalois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.
Galois fields 1 Fields A field is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except by zero) can be performed, and satisfy the usual rules. More
More informationEXPLICIT EVALUATIONS OF SOME WEIL SUMS. 1. Introduction In this article we will explicitly evaluate exponential sums of the form
EXPLICIT EVALUATIONS OF SOME WEIL SUMS ROBERT S. COULTER 1. Introduction In this article we will explicitly evaluate exponential sums of the form χax p α +1 ) where χ is a non-trivial additive character
More informationOn the Number of Trace-One Elements in Polynomial Bases for F 2
On the Number of Trace-One Elements in Polynomial Bases for F 2 n Omran Ahmadi and Alfred Menezes Department of Combinatorics & Optimization University of Waterloo, Canada {oahmadid,ajmeneze}@uwaterloo.ca
More informationA note on constructing permutation polynomials
A note on constructing permutation polynomials Robert Coulter a, Marie Henderson b,1 Rex Matthews c a Department of Mathematical Sciences, 520 Ewing Hall, University of Delaware, Newark, Delaware, 19716,
More informationThe Degree of the Splitting Field of a Random Polynomial over a Finite Field
The Degree of the Splitting Field of a Random Polynomial over a Finite Field John D. Dixon and Daniel Panario School of Mathematics and Statistics Carleton University, Ottawa, Canada {jdixon,daniel}@math.carleton.ca
More informationFinite Fields and Their Applications
Finite Fields and Their Applications 1 01 14 31 Contents lists available at SciVerse ScienceDirect Finite Fields and Their Applications www.elsevier.com/locate/ffa Dickson polynomials over finite fields
More informationVARIETIES WITHOUT EXTRA AUTOMORPHISMS I: CURVES BJORN POONEN
VARIETIES WITHOUT EXTRA AUTOMORPHISMS I: CURVES BJORN POONEN Abstract. For any field k and integer g 3, we exhibit a curve X over k of genus g such that X has no non-trivial automorphisms over k. 1. Statement
More informationARTIN S CONJECTURE AND SYSTEMS OF DIAGONAL EQUATIONS
ARTIN S CONJECTURE AND SYSTEMS OF DIAGONAL EQUATIONS TREVOR D. WOOLEY Abstract. We show that Artin s conjecture concerning p-adic solubility of Diophantine equations fails for infinitely many systems of
More informationLONG CYCLES IN ABC PERMUTATIONS
LONG CYCLES IN ABC PERMUTATIONS IGOR PAK AND AMANDA REDLICH Abstract. An abc-permutation is a permutation σ abc S n obtained by exchanging an initial block of length a a final block of length c of {1,...,
More informationA New Approach to Permutation Polynomials over Finite Fields
A New Approach to Permutation Polynomials over Finite Fields Joint work with Dr. Xiang-dong Hou and Stephen Lappano Department of Mathematics and Statistics University of South Florida Discrete Seminar
More informationPrescribing coefficients of invariant irreducible polynomials
Prescribing coefficients of invariant irreducible polynomials Giorgos Kapetanakis 1 Faculty of Engineering and Natural Sciences, Sabancı Üniversitesi. Ortha Mahalle, Tuzla 34956, İstanbul, Turkey Abstract
More informationHILBERT l-class FIELD TOWERS OF. Hwanyup Jung
Korean J. Math. 20 (2012), No. 4, pp. 477 483 http://dx.doi.org/10.11568/kjm.2012.20.4.477 HILBERT l-class FIELD TOWERS OF IMAGINARY l-cyclic FUNCTION FIELDS Hwanyup Jung Abstract. In this paper we study
More informationarxiv: v4 [math.nt] 1 Jul 2014
The Number of Irreducible Polyomials over Fiite Fields of Characteristic 2 with Give Trace ad Subtrace arxiv:1304.0521v4 [math.nt] 1 Jul 2014 Wo-Ho Ri a,, Gum-Chol Myog a, Ryul Kim a, Chag-Il Rim a a Faculty
More informationCarlitz Rank and Index of Permutation Polynomials
arxiv:1611.06361v1 [math.co] 19 Nov 2016 Carlitz Rank and Index of Permutation Polynomials Leyla Işık 1, Arne Winterhof 2, 1 Salzburg University, Hellbrunnerstr. 34, 5020 Salzburg, Austria E-mail: leyla.isik@sbg.ac.at
More informationOn the Coefficients of Cyclotomic Polynomials
310 On the Coefficients of Cyclotomic Polynomials R. Thangadurai 1. Properties of Cyclotomic Polynomials Cyclotomy is the process of dividing a circle into equal parts, which is precisely the effect obtained
More informationFour classes of permutation polynomials of F 2 m
Finite Fields and Their Applications 1 2007) 869 876 http://www.elsevier.com/locate/ffa Four classes of permutation polynomials of F 2 m Jin Yuan,1, Cunsheng Ding 1 Department of Computer Science, The
More informationMultiplicative Order of Gauss Periods
Multiplicative Order of Gauss Periods Omran Ahmadi Department of Electrical and Computer Engineering University of Toronto Toronto, Ontario, M5S 3G4, Canada oahmadid@comm.utoronto.ca Igor E. Shparlinski
More informationON THE SEMIPRIMITIVITY OF CYCLIC CODES
ON THE SEMIPRIMITIVITY OF CYCLIC CODES YVES AUBRY AND PHILIPPE LANGEVIN Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one exception, that an irreducible cyclic
More informationFINITE FIELD ELEMENTS OF HIGH ORDER ARISING FROM MODULAR CURVES
FINITE FIELD ELEMENTS OF HIGH ORDER ARISING FROM MODULAR CURVES JESSICA F. BURKHART, NEIL J. CALKIN, SHUHONG GAO, JUSTINE C. HYDE-VOLPE, KEVIN JAMES, HIREN MAHARAJ, SHELLY MANBER, JARED RUIZ, AND ETHAN
More informationarxiv: v1 [math.nt] 8 Apr 2016
MSC L05 N37 Short Kloosterman sums to powerful modulus MA Korolev arxiv:6040300v [mathnt] 8 Apr 06 Abstract We obtain the estimate of incomplete Kloosterman sum to powerful modulus q The length N of the
More informationOn the Hansen-Mullen Conjecture for Self-Reciprocal Irreducible Polynomials
On the Hansen-Mullen Conjecture for Self-Reciprocal Irreducible Polynomials Giorgos N. Kapetanakis (joint work with T. Garefalakis) University of Crete Fq10 July 14, 2011 Giorgos Kapetanakis (Crete) On
More informationNewton, Fermat, and Exactly Realizable Sequences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.2 Newton, Fermat, and Exactly Realizable Sequences Bau-Sen Du Institute of Mathematics Academia Sinica Taipei 115 TAIWAN mabsdu@sinica.edu.tw
More informationThree-Bit Monomial Hyperovals
Timothy Vis Timothy.Vis@ucdenver.edu University of Colorado Denver Rocky Mountain Discrete Math Days 2008 Definition of a Hyperoval Definition In a projective plane of order n, a set of n + 1-points, no
More informationPrimitive values of quadratic polynomials in a finite field
Primitive values of quadratic polynomials in a finite field arxiv:1803.01435v2 [math.nt] 22 Mar 2018 Andrew R. Booker School of Mathematics University of Bristol, England andrew.booker@bristol.ac.uk Stephen
More informationDivisibility of Trinomials by Irreducible Polynomials over F 2
Divisibility of Trinomials by Irreducible Polynomials over F 2 Ryul Kim Faculty of Mathematics and Mechanics Kim Il Sung University, Pyongyang, D.P.R.Korea Wolfram Koepf Department of Mathematics University
More informationIncomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
ACTA ARITHMETICA XCIII.4 (2000 Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators by Harald Niederreiter and Arne Winterhof (Wien 1. Introduction.
More information3-Designs from PSL(2, q)
3-Designs from PSL(, q P. J. Cameron a,1 H. R. Maimani b,d G. R. Omidi b,c B. Tayfeh-Rezaie b a School of Mathematical Sciences, Queen Mary, University of London, U.K. b Institute for Studies in Theoretical
More informationNILPOTENCY INDEX OF NIL-ALGEBRA OF NIL-INDEX 3
J. Appl. Math. & Computing Vol. 20(2006), No. 1-2, pp. 569-573 NILPOTENCY INDEX OF NIL-ALGEBRA OF NIL-INDEX 3 WOO LEE Abstract. Nagata and Higman proved that any nil-algebra of finite nilindex is nilpotent
More informationP. J. Cameron a,1 H. R. Maimani b,d G. R. Omidi b,c B. Tayfeh-Rezaie b
3-designs from PSL(, q P. J. Cameron a,1 H. R. Maimani b,d G. R. Omidi b,c B. Tayfeh-Rezaie b a School of Mathematical Sciences, Queen Mary, University of London, U.K. b Institute for Studies in Theoretical
More informationTrace Representation of Legendre Sequences
C Designs, Codes and Cryptography, 24, 343 348, 2001 2001 Kluwer Academic Publishers. Manufactured in The Netherlands. Trace Representation of Legendre Sequences JEONG-HEON KIM School of Electrical and
More informationConstructions of Quadratic Bent Functions in Polynomial Forms
1 Constructions of Quadratic Bent Functions in Polynomial Forms Nam Yul Yu and Guang Gong Member IEEE Department of Electrical and Computer Engineering University of Waterloo CANADA Abstract In this correspondence
More informationA polynomial relaxation-type algorithm for linear programming
A polynomial relaxation-type algorithm for linear programming Sergei Chubanov Institute of Information Systems at the University of Siegen, Germany e-mail: sergei.chubanov@uni-siegen.de 6th February 20
More informationPERFECT POLYNOMIALS OVER F p WITH p + 1 IRREDUCIBLE DIVISORS. 1. Introduction. Let p be a prime number. For a monic polynomial A F p [x] let d
PERFECT POLYNOMIALS OVER F p WITH p + 1 IRREDUCIBLE DIVISORS L. H. GALLARDO and O. RAHAVANDRAINY Abstract. We consider, for a fixed prime number p, monic polynomials in one variable over the finite field
More informationElementary Properties of Cyclotomic Polynomials
Elementary Properties of Cyclotomic Polynomials Yimin Ge Abstract Elementary properties of cyclotomic polynomials is a topic that has become very popular in Olympiad mathematics. The purpose of this article
More informationSection 33 Finite fields
Section 33 Finite fields Instructor: Yifan Yang Spring 2007 Review Corollary (23.6) Let G be a finite subgroup of the multiplicative group of nonzero elements in a field F, then G is cyclic. Theorem (27.19)
More informationA fast algorithm to generate necklaces with xed content
Theoretical Computer Science 301 (003) 477 489 www.elsevier.com/locate/tcs Note A fast algorithm to generate necklaces with xed content Joe Sawada 1 Department of Computer Science, University of Toronto,
More informationTRIPLE FACTORIZATION OF NON-ABELIAN GROUPS BY TWO MAXIMAL SUBGROUPS
Journal of Algebra and Related Topics Vol. 2, No 2, (2014), pp 1-9 TRIPLE FACTORIZATION OF NON-ABELIAN GROUPS BY TWO MAXIMAL SUBGROUPS A. GHARIBKHAJEH AND H. DOOSTIE Abstract. The triple factorization
More informationAbstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications
1 Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair Corrections and clarifications Note: Some corrections were made after the first printing of the text. page 9, line 8 For of the
More informationFermat numbers and integers of the form a k + a l + p α
ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac
More informationarxiv: v2 [math.nt] 5 Dec 2017
Computing the Number of Finite Field Elements with Prescribed Trace and Co-trace Assen Bojilov 1 and Lyubomir Borissov 12 and Yuri Borissov 2 1 Faculty of Mathematics and Informatics Sofia University J.
More informationCharacterization of Multivariate Permutation Polynomials in Positive Characteristic
São Paulo Journal of Mathematical Sciences 3, 1 (2009), 1 12 Characterization of Multivariate Permutation Polynomials in Positive Characteristic Pablo A. Acosta-Solarte Universidad Distrital Francisco
More informationTATE-SHAFAREVICH GROUPS OF THE CONGRUENT NUMBER ELLIPTIC CURVES. Ken Ono. X(E N ) is a simple
TATE-SHAFAREVICH GROUPS OF THE CONGRUENT NUMBER ELLIPTIC CURVES Ken Ono Abstract. Using elliptic modular functions, Kronecker proved a number of recurrence relations for suitable class numbers of positive
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationMath 312/ AMS 351 (Fall 17) Sample Questions for Final
Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply
More informationFinitary Permutation Groups
Finitary Permutation Groups Combinatorics Study Group Notes by Chris Pinnock You wonder and you wonder until you wander out into Infinity, where - if it is to be found anywhere - Truth really exists. Marita
More informationFinding the Largest Fixed-Density Necklace and Lyndon word
Finding the Largest Fixed-Density Necklace and Lyndon word Joe Sawada Patrick Hartman April 18, 2017 Abstract We present an O(n) time algorithm for finding the lexicographically largest fixed-density necklace
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationLow-discrepancy sequences obtained from algebraic function fields over finite fields
ACTA ARITHMETICA LXXII.3 (1995) Low-discrepancy sequences obtained from algebraic function fields over finite fields by Harald Niederreiter (Wien) and Chaoping Xing (Hefei) 1. Introduction. We present
More informationA REFINEMENT OF THE ALLADI-SCHUR THEOREM
A REFINEMENT OF THE ALLADI-SCHUR THEOREM GEORGE E. ANDREWS Abstract. K. Alladi first observed a variant of I. Schur s 1926 partition theore. Namely, the number of partitions of n in which all parts are
More informationOn the number of representations of n by ax 2 + by(y 1)/2, ax 2 + by(3y 1)/2 and ax(x 1)/2 + by(3y 1)/2
ACTA ARITHMETICA 1471 011 On the number of representations of n by ax + byy 1/, ax + by3y 1/ and axx 1/ + by3y 1/ by Zhi-Hong Sun Huaian 1 Introduction For 3, 4,, the -gonal numbers are given by p n n
More informationCONSTRUCTING SUPERSINGULAR ELLIPTIC CURVES. Reinier Bröker
CONSTRUCTING SUPERSINGULAR ELLIPTIC CURVES Reinier Bröker Abstract. We give an algorithm that constructs, on input of a prime power q and an integer t, a supersingular elliptic curve over F q with trace
More informationCongruences involving product of intervals and sets with small multiplicative doubling modulo a prime
Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime J. Cilleruelo and M. Z. Garaev Abstract We obtain a sharp upper bound estimate of the form Hp o(1)
More informationFURTHER EVALUATIONS OF WEIL SUMS
FURTHER EVALUATIONS OF WEIL SUMS ROBERT S. COULTER 1. Introduction Weil sums are exponential sums whose summation runs over the evaluation mapping of a particular function. Explicitly they have the form
More informationNumber-Theoretic Function
Chapter 1 Number-Theoretic Function 1.1 The function τ and σ Definition 1.1.1. Given a positive integer n, let τ(n) denote the number of positive divisor of n and σ(n) denote the sum of these divisor.
More informationarxiv: v1 [math.nt] 6 Jul 2011
UPPER BOUNDS FOR THE NUMBER OF NUMBER FIELDS WITH ALTERNATING GALOIS GROUP ERIC LARSON AND LARRY ROLEN arxiv:1107.118v1 [math.nt] 6 Jul 011 Abstract. We study the number N(n,A n,x) of number fields of
More informationON THE LEAST PRIMITIVE ROOT MODULO p 2
ON THE LEAST PRIMITIVE ROOT MODULO p 2 S. D. COHEN, R. W. K. ODONI, AND W. W. STOTHERS Let h(p) be the least positive primitive root modulo p 2. Burgess [1] indicated that his work on character sums yields
More informationI. INTRODUCTION. A. Definitions and Notations
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 7, JULY 2010 3605 Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes Cunsheng Ding, Senior Member, IEEE, Yang Yang, Student Member,
More informationG Solution (10 points) Using elementary row operations, we transform the original generator matrix as follows.
EE 387 October 28, 2015 Algebraic Error-Control Codes Homework #4 Solutions Handout #24 1. LBC over GF(5). Let G be a nonsystematic generator matrix for a linear block code over GF(5). 2 4 2 2 4 4 G =
More informationOn the existence of primitive completely normal bases of finite fields
On the existence of primitive completely normal bases of finite fields Theodoulos Garefalakis a, Giorgos Kapetanakis b, a Department of Mathematics and Applied Mathematics, University of Crete, Voutes
More informationA PROOF OF THE CONJECTURE OF COHEN AND MULLEN ON SUMS OF PRIMITIVE ROOTS
MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000 000 S 0025-5718(XX)0000-0 A PROOF OF THE CONJECTURE OF COHEN AND MULLEN ON SUMS OF PRIMITIVE ROOTS STEPHEN D. COHEN, TOMÁS OLIVEIRA E SILVA, AND
More informationA combinatorial problem related to Mahler s measure
A combinatorial problem related to Mahler s measure W. Duke ABSTRACT. We give a generalization of a result of Myerson on the asymptotic behavior of norms of certain Gaussian periods. The proof exploits
More informationStephen Cohen, University of Glasgow Methods for primitive and normal polynomials
Stephen Cohen, University of Glasgow Methods for primitive and normal polynomials Primitive and normal polynomials over a finite field are, of course, particular examples of irreducible polynomials over
More informationOn components of vectorial permutations of F n q
On components of vectorial permutations of F n q Nurdagül Anbar 1, Canan Kaşıkcı 2, Alev Topuzoğlu 2 1 Johannes Kepler University, Altenbergerstrasse 69, 4040-Linz, Austria Email: nurdagulanbar2@gmail.com
More informationA note on transitive topological Markov chains of given entropy and period
A note on transitive topological Markov chains of given entropy and period Jérôme Buzzi and Sylvie Ruette November, 205 Abstract We show that, for every positive real number h and every positive integer
More informationOn complete permutation polynomials 1
Fourteenth International Workshop on Algebraic and Combinatorial Coding Theory September 7 13, 2014, Svetlogorsk (Kaliningrad region), Russia pp. 57 62 On complete permutation polynomials 1 L. A. Bassalygo
More informationOpen Problems for Polynomials over Finite Fields and Applications 1
Open Problems for Polynomials over Finite Fields and Applications 1 School of Mathematics and Statistics Carleton University daniel@math.carleton.ca ALCOMA, March 2015 1 Open problems for polynomials over
More informationPrime Divisors of Palindromes
Prime Divisors of Palindromes William D. Banks Department of Mathematics, University of Missouri Columbia, MO 6511 USA bbanks@math.missouri.edu Igor E. Shparlinski Department of Computing, Macquarie University
More informationNAP Module 4. Homework 2 Friday, July 14, 2017.
NAP 2017. Module 4. Homework 2 Friday, July 14, 2017. These excercises are due July 21, 2017, at 10 pm. Nepal time. Please, send them to nap@rnta.eu, to laurageatti@gmail.com and schoo.rene@gmail.com.
More informationSome Arithmetic Functions Involving Exponential Divisors
2 3 47 6 23 Journal of Integer Sequences, Vol. 3 200, Article 0.3.7 Some Arithmetic Functions Involving Exponential Divisors Xiaodong Cao Department of Mathematics and Physics Beijing Institute of Petro-Chemical
More informationSOME RESULTS AND PROBLEMS IN PROBABILISTIC NUMBER THEORY
Annales Univ. Sci. Budapest., Sect. Comp. 43 204 253 265 SOME RESULTS AND PROBLEMS IN PROBABILISTIC NUMBER THEORY Imre Kátai and Bui Minh Phong Budapest, Hungary Le Manh Thanh Hue, Vietnam Communicated
More informationActa Mathematica Academiae Paedagogicae Nyíregyháziensis 32 (2016), ISSN
Acta Mathematica Academiae Paedagogicae Nyíregyháziensis 3 06, 3 3 www.emis.de/journals ISSN 786-009 A NOTE OF THREE PRIME REPRESENTATION PROBLEMS SHICHUN YANG AND ALAIN TOGBÉ Abstract. In this note, we
More informationDensity of non-residues in Burgess-type intervals and applications
Bull. London Math. Soc. 40 2008) 88 96 C 2008 London Mathematical Society doi:0.2/blms/bdm Density of non-residues in Burgess-type intervals and applications W. D. Banks, M. Z. Garaev, D. R. Heath-Brown
More informationSome Open Problems Arising from my Recent Finite Field Research
Some Open Problems Arising from my Recent Finite Field Research Gary L. Mullen Penn State University mullen@math.psu.edu July 13, 2015 Some Open Problems Arising from myrecent Finite Field Research July
More informationx 3 2x = (x 2) (x 2 2x + 1) + (x 2) x 2 2x + 1 = (x 4) (x + 2) + 9 (x + 2) = ( 1 9 x ) (9) + 0
1. (a) i. State and prove Wilson's Theorem. ii. Show that, if p is a prime number congruent to 1 modulo 4, then there exists a solution to the congruence x 2 1 mod p. (b) i. Let p(x), q(x) be polynomials
More information