Related papers: On Permutation Binomials over Finite Fields

We provide sufficient and necessary conditions for the coefficients of a $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ which ensure that the number of distinct roots of $f$ in $\mathbb{F}_{q^n}$ equals the degree of $f$. We say that these…

Many-to-one mappings and permutation polynomials over finite fields have important applications in cryptography and coding theory. In this paper, we study the many-to-one property of a large class of polynomials such as $f(x) = h(a x^q + b…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

We present new classes of permutation polynomials over finite fields.

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…

This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation…

We consider the equation $P(Q(x_1,\ldots,x_\nu))=Q(P(x_1),\ldots,P(x_\nu))$ in polynomials over the field of complex numbers and prove that if ${\rm deg}(P)>1$, then it is only solvable in polynomials that are affinely conjugate to…

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements $a_1,...,a_m$ of the cyclic group of order $m$, there is a permutation $\pi$ such that…

Permutation polynomials with explicit constructions over finite fields have long been a topic of great interest in number theory. In recent years, by applying linear translators of functions from $\mathbb{F}_{q^n}$ to $\mathbb{F}_q$, many…

We demonstrate, using character sum arguments, the existence of primitive polynomials of degree n over a finite field GF(q) with the coefficients for x^(n-1), x^(n-2), and x^(n-3) prescribed, so long as char(GF(q)) is at least 5 and n is at…

We provide an easy method for the construction of characteristic polynomials of simple ordinary abelian varieties ${\mathcal A}$ of dimension $g$ over a finite field ${\mathbb F}_q$, when $q\ge 4$ and $2g=\rho^{b-1}(\rho-1)$ for some prime…

We first prove that if $a$ has a prime factor not dividing $b$ then there are infinitely many positive integers $n$ such that $\binom {an+bn} {an}$ is not divisible by $bn+1$. This confirms a recent conjecture of Z.-W. Sun. Moreover, we…

Let $\xi\in\mathbb{F}_{q^m}$ be an $r$-primitive $k$-normal element over $\mathbb{F}_q$, where $q$ is a prime power and $m$ is a positive integer. The minimal polynomial of $\xi$ is referred to be the $r$-primitive $k$-normal polynomial of…

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Let $k \geq 2$, $q$ be an odd prime power, and $F \in \mathbb{F}_q[x_1, \ldots, x_k]$ be a polynomial. An $F$-Diophantine set over a finite field $\mathbb{F}_q$ is a set $A \subset \mathbb{F}_q^*$ such that $F(a_1, a_2, \ldots, a_k)$ is a…

Let $q$ be a prime power and $\mathbb{F}_q$ the finite field with $q$ elements. For a positive integer $n$, the binomial $X^n - 1 \in \mathbb{F}_q[X]$ is said to be $3$-sparse over $\mathbb{F}_q$ if every irreducible factor of $X^n-1$ in…

Let $F$ be a field of $q$ elements, where $q$ is a power of an odd prime. Fix $n = (q+1)/2$. For each $s \in F$, we describe all the irreducible factors over $F$ of the polynomial $g_s(y): = y^n + (1-y)^n -s$, and we give a necessary and…

Let $\mathbb{F}_q$ denote the finite field of characteristic $p$ and order $q$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic rational integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. Given two positive…