English
Related papers

Related papers: A note on two classes of permutation polynomials o…

200 papers

In this article, we give a complete description of the characteristic polynomials of supersingular abelian varieties over finite fields. We list them for the dimensions upto 7.

Algebraic Geometry · Mathematics 2011-10-07 Vijaykumar Singh , Gary McGuire , Alexey Zaytsev

This paper addresses the topic of equidistribution and recurrence for polynomial sequences over function fields. The main focus is to note and correct two small errors in [V. Bergelson and A. Leibman, A Weyl-type equidistribution theorem in…

Number Theory · Mathematics 2026-03-24 Ethan Ackelsberg , Vitaly Bergelson

In a recent paper Zhang et al. constructed 17 families of permutation pentanomials of the form $x^t+x^{r_1(q-1)+t}+x^{r_2(q-1)+t}+x^{r_3(q-1)+t}+x^{r_4(q-1)+t}$ over $\mathbb{F}_{q^2}$ where $q=2^m$. In this paper for 14 of these 17…

Combinatorics · Mathematics 2024-12-20 Farhana Kousar , Maosheng Xiong

We construct a new family of permutation group polynomials over finite fields of arbitrary characteristic, which are special types of bivariate local permutation polynomials. For this family, we explicitly construct their companion. We also…

Combinatorics · Mathematics 2026-02-03 Sartaj Ul Hasan , Ramandeep Kaur , Hridesh Kumar

We focus on the permutation polynomials of the form $L(X)+\Tr_{m}^{3m}(X)^{s}$ over $\F_{q^3}$, where $\F_q$ is the finite field with $q=p^m$ elements, $p$ is a prime number, $m$ is a positive integer, $\Tr_{m}^{3m}$ is the relative trace…

Number Theory · Mathematics 2024-07-18 Sartaj Ul Hasan , Ramandeep Kaur

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

Combinatorics · Mathematics 2023-06-28 Anitha G , P Vanchinathan

We present various constructions of sequences of polynomials satisfying the Binomial Theorem in finite characteristic based on the theory of additive polynomials. Various actions on these constructions are also presented. It is an open…

Number Theory · Mathematics 2014-12-11 David Goss

We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field,…

Number Theory · Mathematics 2013-11-01 Aleksandr Tuxanidy , Qiang Wang

We determine all permutation polynomials among several families of polynomials over $\mathbb{F}_{q^3}$ for arbitrary prime powers $q$. We obtain some new families of permutation polynomials over $\mathbb{F}_{q^3}$ with simple coefficients…

Combinatorics · Mathematics 2026-05-18 Zhiguo Ding , Xu Song , Wei Xiong

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…

Information Theory · Computer Science 2016-12-13 Nastja Cepak , Pascale Charpin , Enes Pasalic

In this paper, we propose linear maps over the space of all polynomials $f(x)$ in $\mathbb{F}_q[x]$ that map $0$ to itself, through their evaluation map. Properties of these linear maps throw up interesting connections with permutation…

Number Theory · Mathematics 2019-11-12 Megha M. Kolhekar , Harish K. Pillai

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

An involution over finite fields is a permutation polynomial whose inverse is itself. Owing to this property, involutions over finite fields have been widely used in applications such as cryptography and coding theory. As far as we know,…

Information Theory · Computer Science 2018-11-29 Dabin Zheng , Mu Yuan , Nian Li , Lei Hu , Xiangyong Zeng

Permutation rational functions over finite fields have attracted much attention in recent years. In this paper, we introduce a class of permutation rational functions over $\mathbb F_{q^2}$, whose numerators are so-called $q$-quadratic…

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

In this paper we initiate a study on Gauss factorials of polynomials over finite fields, which are the analogues of Gauss factorials of positive integers.

Number Theory · Mathematics 2017-04-19 Xiumei Li , Min Sha

In 2019, Xiang Fan \cite{xfan} classified all permutation polynomials of degree $7$ over finite fields of odd characteristics. In this paper, we use this classification to determine the complete list of degree $7$ orthomorphism polynomials…

Number Theory · Mathematics 2026-01-30 Bhitali Kousik , Dhiren Kumar Basnet

We determine all permutations in two large classes of polynomials over finite fields, where the construction of the polynomials in each class involves the denominators of a class of rational functions generalizing the classical Redei…

Number Theory · Mathematics 2023-05-11 Zhiguo Ding , Michael E. Zieve

We introduce a class of permutation polynomial over $\mathbb F_{q^n}$ that can be written in the form $\frac{L(x)}{x^{q+1}}$ or $\frac{L(x^{q+1})}x$ for some $q$-linear polynomial $L$ over $\mathbb F_{q^n}$. Specifically, we present those…

Number Theory · Mathematics 2024-03-19 Ruikai Chen , Sihem Mesnager

In this note, a criterion for a class of binomials to be permutation polynomials is proposed. As a consequence, many classes of binomial permutation polynomials and monomial complete permutation polynomials are obtained. The exponents in…

Number Theory · Mathematics 2013-10-02 Ziran Tu , Xiangyong Zeng , Lei Hu , Chunlei Li

Four recursive constructions of permutation polynomials over $\gf(q^2)$ with those over $\gf(q)$ are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over…

Information Theory · Computer Science 2015-11-12 Cunsheng Ding , Pingzhi Yuan