Permutation binomials over finite fields

From MaRDI portal
Publication:5322889

DOI10.1090/S0002-9947-09-04578-4zbMATH Open1239.11139arXiv0707.1108OpenAlexW1971255859MaRDI QIDQ5322889FDOQ5322889


Authors: Michael E. Zieve, Ariane M. Masuda Edit this on Wikidata


Publication date: 23 July 2009

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Abstract: We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then there exist permutation binomials over GF(q) of the form x^m + c*x^n if and only if gcd(m,n,q-1) = 1.


Full work available at URL: https://arxiv.org/abs/0707.1108




Recommendations




Cites Work


Cited In (39)





This page was built for publication: Permutation binomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322889)