Table of Contents
Fetching ...

New permutation polynomials over $\mathbb{F}_{q^2}$

Xuan Pang, Pingzhi Yuan, Danyao Wu, Huanhuan Guan

TL;DR

The paper addresses constructing permutation polynomials over $\mathbb{F}_{q^2}$ and proposes a novel multivariate reduction method that bypasses the AGW criterion. It applies this framework to polynomials of the form $(x^{q}-x+\delta)^s+\gamma L(x)$, deriving explicit necessary and sufficient conditions in odd and even characteristics and producing multiple new classes of PPs, complemented by an alternative construction for higher extensions. Central to the results are reductions to two-variable permutation tests over $\mathbb{F}_q$ via a chosen $\mathbb{F}_q$-basis, with conditions expressed through traces and norms like $Tr_q^{q^2}(\cdot)$ and $N_q^{q^2}(\cdot)$. The work broadens the catalog of PPs over $\mathbb{F}_{q^2}$ and offers templates for systematic construction beyond AGW, while also outlining extensions to $\mathbb{F}_{q^d}$ and connections to direction-set concepts.

Abstract

In this paper, we propose a new method to obtain new permutation polynomials over $\mathbb{F}_{q^2}$. Using this method, we extend many known permutation polynomials, which take the form $\sum_i(x^q-x+δ)^{s_i}+L(x)$, where $L(x)$ is a $q$-polynomial over $\mathbb{F}_q$ and $δ\in\mathbb{F}_{q^2}$. We also present an alternative approach for constructing permutation polynomials of the form $x+γTr_q^{q^d}(x^{q+1}+x^{2q+2})$ for the cases where $q=2^m$, $2\nmid d$ and $ Tr_q^{q^d}(x)=x+x^q+\dots+x^{q^{d-1}}$.

New permutation polynomials over $\mathbb{F}_{q^2}$

TL;DR

The paper addresses constructing permutation polynomials over and proposes a novel multivariate reduction method that bypasses the AGW criterion. It applies this framework to polynomials of the form , deriving explicit necessary and sufficient conditions in odd and even characteristics and producing multiple new classes of PPs, complemented by an alternative construction for higher extensions. Central to the results are reductions to two-variable permutation tests over via a chosen -basis, with conditions expressed through traces and norms like and . The work broadens the catalog of PPs over and offers templates for systematic construction beyond AGW, while also outlining extensions to and connections to direction-set concepts.

Abstract

In this paper, we propose a new method to obtain new permutation polynomials over . Using this method, we extend many known permutation polynomials, which take the form , where is a -polynomial over and . We also present an alternative approach for constructing permutation polynomials of the form for the cases where , and .

Paper Structure

This paper contains 7 sections, 23 theorems, 109 equations, 1 table.

Key Result

Proposition 2.1

Let $\{\alpha_1, \alpha_2, \dots, \alpha_n\}$ be a basis of $\mathbb{F}_{q^n}$ over $\mathbb{F}_q$. For a polynomial $f(x)\in\mathbb{F}_{q^n}[x]$ and $a_i, b_i\in \mathbb{F}_q$, $1\le i\le n$, we let where $A=(a_{ij})_{n\times n}, B=(b_{ij})_{n\times n}\in M_n(\mathbb{F}_q)$ are invertible matrices over $\mathbb{F}_q$, and $(\alpha_1, \dots, \alpha_n)^T$ denotes the transpose of $(\alpha_1, \dots

Theorems & Definitions (34)

  • Proposition 2.1
  • proof
  • Proposition 2.2
  • Example 2.1
  • proof
  • Lemma 3.1
  • Theorem 3.1
  • proof
  • Theorem 3.2
  • Theorem 3.3
  • ...and 24 more