The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1

Displaying 1 – 6 of 6

Showing per page

Determination of a type of permutation trinomials over finite fields

Xiang-dong Hou (2014)

Acta Arithmetica

Let f = a x + b x q + x 2 q - 1 q [ x ] . We find explicit conditions on a and b that are necessary and sufficient for f to be a permutation polynomial of q ² . This result allows us to solve a related problem: Let g n , q p [ x ] (n ≥ 0, p = c h a r q ) be the polynomial defined by the functional equation c q ( x + c ) n = g n , q ( x q - x ) . We determine all n of the form n = q α - q β - 1 , α > β ≥ 0, for which g n , q is a permutation polynomial of q ² .

Dickson curves.

Gomez-Calderon, Javier (2006)

International Journal of Mathematics and Mathematical Sciences

Dickson Polynomials that are Permutations

Cipu, Mihai (2004)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: 11T06, 13P10.A theorem of S.D. Cohen gives a characterization for Dickson polynomials of the second kind that permutes the elements of a finite field of cardinality the square of the characteristic. Here, a different proof is presented for this result.Research supported by the CERES program of the Ministry of Education, Research and Youth, contract nr. 39/2002.

Currently displaying 1 – 6 of 6

Page 1