English

A New Approach to Permutation Polynomials over Finite Fields, II

Combinatorics 2012-08-15 v1 Number Theory

Abstract

Let pp be a prime and qq a power of pp. For n0n\ge 0, let gn,qFp[x]g_{n,q}\in\Bbb F_p[{\tt x}] be the polynomial defined by the functional equation aFq(x+a)n=gn,q(xqx)\sum_{a\in\Bbb F_q}({\tt x}+a)^n=g_{n,q}({\tt x}^q-{\tt x}). When is gn,qg_{n,q} a permutation polynomial (PP) of Fqe\Bbb F_{q^e}? This turns out to be a challenging question with remarkable breath and depth, as shown in the predecessor of the present paper. We call a triple of positive integers (n,e;q)(n,e;q) {\em desirable} if gn,qg_{n,q} is a PP of Fqe\Bbb F_{q^e}. In the present paper, we find many new classes of desirable triples whose corresponding PPs were previously unknown. Several new techniques are introduced for proving a given polynomial is a PP.

Keywords

Cite

@article{arxiv.1208.2942,
  title  = {A New Approach to Permutation Polynomials over Finite Fields, II},
  author = {Neranga Fernando and Xiang-dong Hou and Stephen D. Lappano},
  journal= {arXiv preprint arXiv:1208.2942},
  year   = {2012}
}

Comments

47 pages, 3 tables

R2 v1 2026-06-21T21:50:37.132Z