Nonexistence of permutation binomials of certain shapes

MaRDI QIDQ2372897zbMATH OpenFDO

Authors Ariane M. Masuda, Michael E. Zieve

Publication date 16 July 2007

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0707.1102, https://eudml.org/doc/129922, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1n12.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Abstract: Suppose x^m + c*x^n is a permutation polynomial over GF(p), where p>5 is prime, m>n>0, and c is in GF(p)^*. We prove that gcd(m-n,p-1) is not 2 or 4. In the special case that either (p-1)/2 or (p-1)/4 is prime, this was conjectured in a recent paper by Masuda, Panario and Wang.

Review text

Summary: Suppose \(x^m+ax^n\) is a permutation polynomial over \({\mathbb F}_p\), where \(p>5\) is prime and \(m>n>0\) and \(a\in{\mathbb F}_p^*\). We prove that \(\gcd(m-n,p-1)\notin\{2,4\}\). In the special case that either \((p-1)/2\) or \((p-1)/4\) is prime, this was conjectured in a recent paper by \textit{A. Masuda, D. Panario} and \textit{Q. Wang} [Electron. J. Comb. 13, No. 1, Research paper R65, 15 p. (2006; Zbl 1121.11077)].

Recommendations

• Permutation binomials over finite fields
• On permutation binomials
• On permutation binomials over finite fields
• Permutation binomials
• A class of permutation binomials over finite fields

Cited in

(2)

• The Nonexistence of Permutations EA-Equivalent to Certain AB Functions
• Permutation binomials over finite fields

This page was built for publication: Nonexistence of permutation binomials of certain shapes

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