English
Related papers

Related papers: Full Classification of permutation rational functi…

200 papers

Let $\mu_{q+1}$ denote the set of $(q+1)$-th roots of unity in $\mathbb{F}_{q^2 }$. We construct permutation polynomials over $\mathbb{F}_{q^2}$ by using rational functions of any degree that induce bijections either on $\mu_{q+1}$ or…

Combinatorics · Mathematics 2018-02-15 Daniele Bartoli , Ariane M. Masuda , Luciane Quoos

Planar functions are mappings from a finite field $\mathbb{F}_q$ to itself with an extremal differential property. Such functions give rise to finite projective planes and other combinatorial objects. There is a subtle difference between…

Combinatorics · Mathematics 2018-09-18 Daniele Bartoli , Kai-Uwe Schmidt

We study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree $k$ over $\mathbb{F}_q$ is induced by an action from…

Number Theory · Mathematics 2018-09-21 Lucas Reis , Qiang Wang

Two rational functions $f,g\in\Bbb F_q(X)$ are said to be {\em equivalent} if there exist $\phi,\psi\in\Bbb F_q(X)$ of degree one such that $g=\phi\circ f\circ\psi$. We give an explicit formula for the number of equivalence classes of…

Number Theory · Mathematics 2025-06-27 Xiang-dong Hou

We construct classes of permutation polynomials over F_{Q^2} by exhibiting classes of low-degree rational functions over F_{Q^2} which induce bijections on the set of (Q+1)-th roots of unity in F_{Q^2}. As a consequence, we prove two…

Number Theory · Mathematics 2013-10-08 Michael Zieve

We consider four classes of polynomials over the fields $\mathbb{F}_{q^3}$, $q=p^h$, $p>3$, $f_1(x)=x^{q^2+q-1}+Ax^{q^2-q+1}+Bx$, $f_2(x)=x^{q^2+q-1}+Ax^{q^3-q^2+q}+Bx$, $f_3(x)=x^{q^2+q-1}+Ax^{q^2}-Bx$, $f_4(x)=x^{q^2+q-1}+Ax^{q}-Bx$,…

Combinatorics · Mathematics 2018-04-05 Daniele Bartoli

Motivated by many recent constructions of permutation polynomials over $\mathbb{F}_{q^2}$, we study permutation polynomials over $\mathbb{F}_{q^3}$ in terms of their coefficients. Based on the multivariate method and resultant elimination,…

Number Theory · Mathematics 2018-06-18 Yanping Wang , WeiGuo Zhang , Daniele Bartoli , Qiang Wang

Let $p$ be a prime and $q$ a power of $p$. For $n\ge 0$, let $g_{n,q}\in\Bbb F_p[{\tt x}]$ be the polynomial defined by the functional equation $\sum_{a\in\Bbb F_q}({\tt x}+a)^n=g_{n,q}({\tt x}^q-{\tt x})$. When is $g_{n,q}$ a permutation…

Combinatorics · Mathematics 2012-08-15 Neranga Fernando , Xiang-dong Hou , Stephen D. Lappano

The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems $F=(f_1(x,y),f_2(x,y))$…

Number Theory · Mathematics 2025-08-05 Xuan Pang , Yangcheng Li , Pingzhi Yuan , Yuanpeng Zeng

Let $\mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with…

Information Theory · Computer Science 2019-07-09 Xiaogang Liu

Let $\mathbb{F}_q$ be the finite field of $q$ elements. Then a \emph{permutation polynomial} (PP) of $\mathbb{F}_q$ is a polynomial $f \in \mathbb{F}_q[x]$ such that the associated function $c \mapsto f(c)$ is a permutation of the elements…

Number Theory · Mathematics 2012-11-27 Christopher J. Shallue

We find a formula for the number of permutation polynomials of degree q-2 over a finite field Fq, which has q elements, in terms of the permanent of a matrix. We write down an expression for the number of permutation polynomials of degree…

Rings and Algebras · Mathematics 2013-12-18 Kwang-Yon Kim , Ryul Kim

Let $p$ be a prime and $n$ be a positive integer. Let $f_b(X)=X+(X^p-X+b)^{-1}$, where $b\in\Bbb F_{p^n}$ is such that $\text{Tr}_{p^n/p}(b)\ne 0$. In 2008, Yuan et al. \cite{Yuan-Ding-Wang-Pieprzyk-FFA-2008} showed that for $p=2,3$, $f_b$…

Number Theory · Mathematics 2020-01-07 Xiang-dong Hou , Christopher Sze

We classify complete permutation polynomials of type $aX^{\frac{q^n-1}{q-1}+1}$ over the finite field with $q^n$ elements, for $n+1$ a prime and $n^4 < q$. For the case $n+1$ a power of the characteristic we study some known families. We…

Combinatorics · Mathematics 2017-02-20 Daniele Bartoli , Massimo Giulietti , Luciane Quoos , Giovanni Zini

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

Information Theory · Computer Science 2013-08-28 Pingzhi Yuan , Cunsheng Ding

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Number Theory · Mathematics 2024-01-01 Ruikai Chen , Sihem Mesnager

For $q$ a prime power and $\phi$ a rational function with coefficients in $\mathbb{F}_q$, let $p(q,\phi)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_q)$ that is periodic with respect to $\phi$. And if $d$ is a positive integer, let $Q_d$…

Number Theory · Mathematics 2024-12-24 Derek Garton

Let $f=a{\tt x} +b{\tt x}^q+{\tt x}^{2q-1}\in\Bbb F_q[{\tt x}]$. We find explicit conditions on $a$ and $b$ that are necessary and sufficient for $f$ to be a permutation polynomial of $\Bbb F_{q^2}$. This result allows us to solve a related…

Number Theory · Mathematics 2013-09-16 Xiang-dong Hou

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…

Number Theory · Mathematics 2019-05-21 Daniel Panario , Lucas Reis , Qiang Wang

A permutation rational function $f\in \mathbb{F}_q(x)$ is a rational function that induces a bijection on $\mathbb{F}_q$, that is, for all $y\in\mathbb{F}_q$ there exists exactly one $x\in\mathbb{F}_q$ such that $f(x)=y$. Permutation…

Number Theory · Mathematics 2017-07-20 Gaetan Bisson , Mehdi Tibouchi