Permutation polynomials on F_q induced from bijective Redei functions on subgroups of the multiplicative group of F_q

2013/10/02 by Michael Zieve, Zieve, Michael
Computer Science · Mathematics · #11T06 (Primary) 05A05 #11T55 (Secondary) #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT) #cs.IT #math.CO #math.IT #math.NT #msc:05A05 #msc:11T06 #msc:11T55

paper · pdf · doi:10.48550/arxiv.1310.0776

8 pages; paper completely rewritten, now the results are much more general

arxiv created 2013/10/07 · arxiv updated 2013/10/08

Abstract

We construct classes of permutation polynomials over F_Q² by exhibiting classes of low-degree rational functions over F_Q² which induce bijections on the set of (Q+1)-th roots of unity in F_Q². As a consequence, we prove two conjectures about permutation trinomials from a recent paper by Tu, Zeng, Hu and Li.

Related

• Permutation polynomials over \mathbbF_q² from rational functions
• A Recursive Construction of Permutation Polynomials over \mathbbF_q² with Odd Characteristic from Rédei Functions
• Constructing permutation polynomials using generalized Redei functions
• Permutation polynomials over finite fields from low-degree rational functions
• A General Construction of Permutation Polynomials of \Bbb F_q²