Permutation binomials
A polynomial f over a finite feld F is a permutation polynomial if the mapping F→F defined by f is one-to-one. We are concerned here with binomials, that is, polynomials of the shape f=aXi+bXj+c, i>j≥1. Even in this restricted setting, it is impossible to give general necessary and sufficient con...
Saved in:
Main Author: | Charles Small |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1990-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171290000497 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
q-Analogue of a binomial coefficient congruence
by: W. Edwin Clark
Published: (1995-01-01) -
Skew Field on the Binomial Coefficients in Combinatorial Geometric Series
by: Chinnaraji Annamalai, et al.
Published: (2022-11-01) -
Equivalence classes of matrices over a finite field
by: Gary L. Mullen
Published: (1979-01-01) -
Series and Summations on Binomial Coefficients of Optimized Combination
by: Chinnaraji Annamalai, et al.
Published: (2022-04-01) -
The radical factors of f(x)−f(y) over finite fields
by: Javier Gomez-Calderon
Published: (1997-01-01)