On some permutation polynomials over finite fields (Q2368380)

From MaRDI portal
Revision as of 11:47, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On some permutation polynomials over finite fields
scientific article

    Statements

    On some permutation polynomials over finite fields (English)
    0 references
    0 references
    0 references
    19 April 2006
    0 references
    Let \(q\) be a prime power of the form \(q=7s+1\). The authors classify the permutation binomials \(P(X)=X^r(1+X^{es})\), \(1\leq e\leq 6\), in terms of the sequence \((a_n)\) defined by \(a_n=a_{n-1}+2a_{n-2}-a_{n-3}\), \(n\geq 3\), with initial values \(a_0=3\), \(a_1=1\), and \(a_2=5\). For prime powers of the form \(q=3s+1\) and \(q=5s+1\) the permutation behaviour of binomials was studied by \textit{L. Wang} [Finite Fields Appl. 8, No. 3, 311--322 (2002; Zbl 1044.11103)]. For results on arbitrary permutation binomials see the authors' paper [Proc. Am. Math. Soc. 134, No. 1, 15--22 (2006; Zbl 1137.11355)].
    0 references
    0 references
    permutation polynomials
    0 references
    finite fields
    0 references
    binomials
    0 references
    0 references