Related papers: Specific permutation polynomials over finite field…

We give all splitting bi-unitary perfect polynomials over the field $\mathbb{F}_4$ and some splitting ones over $\mathbb{F}_{p^2}$, if $p$ is an odd prime.

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…

Let $\mathbb{F}_{q}$ be the finite field of characteristic $p$ containing $q = p^{r}$ elements and $f(x)=ax^{n} + x^{m}$ a binomial with coefficients in this field. If some conditions on the gcd of $n-m$ an $q-1$ are satisfied then this…

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…

We determine necessary and sufficient conditions for unicritical polynomials to be dynamically irreducible over finite fields. This result extends the results of Boston-Jones and Hamblen-Jones-Madhu regarding the dynamical irreducibility of…

We show that all of the "new" permutation polynomials in the recent paper arXiv:2207.13335 (H. Song et al.) are in fact known. We also present a new type of question in this area.

In this paper we introduce a method of characteristic sets with respect to several term orderings for difference-differential polynomials. Using this technique, we obtain a method of computation of multivariate dimension polynomials of…

Some families of linear permutation polynomials of $\mathbb{F}_{q^{ms}}$ with coefficients in $\mathbb{F}_{q^{m}}$ are explicitly described (via conditions on their coefficients) as isomorphic images of classical subgroups of the general…

In this paper we find exact formulas for the numbers of partitions and compositions of an element into $m$ parts over a finite field, i.e. we find the number of nonzero solutions of the equation $x_1+x_2+...+x_m=z$ over a finite field when…

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…

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…

Necessary and sufficient conditions on $A,B\in \mathbb{F}_{q^3}^*$ for $f(X)=X^{q^2-q+1}+AX^{q^2}+BX$ being a permutation polynomial of $\mathbb{F}_{q^3}$ are investigated via a connection with algebraic varieties over finite fields.

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…

We study the explicit formula of Euler numbers and polynomials of higher order

Permutation polynomials with few terms (especially permutation binomials) attract many people due to their simple algebraic structure. Despite the great interests in the study of permutation binomials, a complete characterization of…

Finite field transforms have many applications and, in many cases, can be implemented with a low computational complexity. In this paper, the Z Transform over a finite field is introduced and some of its properties are presented.

In this paper, we introduce the new fully degenerate poly-Bernoulli numbers and polynomials and investigate some properties of these polynomials and numbers. From our properties, we derive some identities for the fully degenerate…

We prove an asymptotic formula for the number of permutation for which the associated permutation polynomial has degree smaller than $q-2$.

Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…