Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T21:47:08.303Z Has data issue: false hasContentIssue false

ON PERMUTATION BINOMIALS OVER FINITE FIELDS

Published online by Cambridge University Press:  28 March 2013

MOHAMED AYAD
Affiliation:
Laboratoire de Mathématiques Pures et Appliquées, Université du Littoral, F-62228 Calais, France email ayad@lmpa.univ-littoral.fr
KACEM BELGHABA
Affiliation:
Laboratoire de Mathématiques et ses Applications, Université d’Oran, BP 15 24, Algeria email belghaba.kacem@univ-oran.dz
OMAR KIHEL*
Affiliation:
Department of Mathematics, Brock University, Ontario, Canada L2S 3A1 email okihel@brocku.ca
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let ${ \mathbb{F} }_{q} $ be the finite field of characteristic $p$ containing $q= {p}^{r} $ elements and $f(x)= a{x}^{n} + {x}^{m} $, a binomial with coefficients in this field. If some conditions on the greatest common divisor of $n- m$ and $q- 1$ are satisfied then this polynomial does not permute the elements of the field. We prove in particular that if $f(x)= a{x}^{n} + {x}^{m} $ permutes ${ \mathbb{F} }_{p} $, where $n\gt m\gt 0$ and $a\in { \mathbb{F} }_{p}^{\ast } $, then $p- 1\leq (d- 1)d$, where $d= \gcd (n- m, p- 1)$, and that this bound of $p$, in terms of $d$ only, is sharp. We show as well how to obtain in certain cases a permutation binomial over a subfield of ${ \mathbb{F} }_{q} $ from a permutation binomial over ${ \mathbb{F} }_{q} $.

Information

Type
Research Article
Copyright
Copyright ©2013 Australian Mathematical Publishing Association Inc.