Related papers: New classes of permutation polynomials with coeffi…

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…

We study the structure of the Fourier coefficients of low degree multivariate polynomials over finite fields. We consider three properties: (i) the number of nonzero Fourier coefficients; (ii) the sum of the absolute value of the Fourier…

Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for…

We build a new theory for analyzing the coefficients of any cyclotomic polynomial by considering it as a gcd of simpler polynomials. Using this theory, we generalize a result known as periodicity and provide two new families of flat…

We obtain explicit factorizations of reduced period polynomials of degree $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. This extends the results of G. Myerson, who considered the cases $m=1$ and $m=2$, and…

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…

R. Gupta, P. Gahlyan and R.K. Sharma presented three classes of permutation trinomials over $\mathbb{F}_{q^3}$ in Finite Fields and Their Applications. In this paper, we employ the local method to prove that those polynomials are indeed…

In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…

Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…

The previous paper [4] proved the existence of primitive polynomials and primitive normal polynomials of degree n with k prescribed coefficients in the finite field GF(q) for all sufficiently large q. This paper presents a loger versions of…

Let $p$ be a prime. In this paper, we give a complete classification of self-reciprocal polynomials arising from Fibonacci polynomials over $\mathbb{Z}$ and $\mathbb{Z}_p$, where $p=2$ and $p>5$. We also present some partial results when…

We give necessary and sufficient conditions for a polynomial of the form x^r*(1+x^v+x^(2v)+...+x^(kv))^t to permute the elements of the finite field GF(q). Our results yield especially simple criteria in case (q-1)/gcd(q-1,v) is a small…

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

Let $f=a\x+\x^{3q-2}\in\Bbb F_{q^2}[\x]$, where $a\in\Bbb F_{q^2}^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q=2^e$, $e$ odd, and $a^{\frac{q+1}3}$ is a primitive…

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…

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…

A formula of Stembridge states that the permutation peak polynomials and descent polynomials are connected via a quadratique transformation. The aim of this paper is to establish the cycle analogue of Stembridge's formula by using cycle…

For an odd prime power $q$ satisfying $q\equiv 1\pmod 3$ we construct totally $2(q-1) $ permutation polyomials, all giving involutory permutations with exactly $ 1+ \frac{q-1}3$ fixed points. Among them $(q-1)$ polynomials are trinomials,…

We give new, short proofs of recent permutation polynomial results of Bousalmi, Bayad, and Derbal by reducing the verification to explicit computations on a three-element multiplicative subgroup via Zieve's fiber criterion. Building on this…

We present a new technique for computing permutation polynomials based on equivalence relations. The equivalence relations are defined by expanded normalization operations and new functions that map permutation polynomials (PPs) to other…