Related papers: Permutation polynomials over finite fields from lo…

We prove that non-pretentious multiplicative functions are orthogonal to polynomials over $\mF_q[x]$ (up to characteristic conditions).

We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.

In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation…

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…

Divisibility of trinomials by given polynomials over finite fields has been studied and used to construct orthogonal arrays in recent literature. Dewar et al.\ (Des.\ Codes Cryptogr.\ 45:1-17, 2007) studied the division of trinomials by a…

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,…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

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…

We construct a class of permutation polynomials of $\bF_{2^m}$ that are closely related to Dickson polynomials.

We described a minimal separating set for the algebra of $O(F_q)$-invariant polynomial functions of $m$-tuples of two-dimensional vectors over a finite field $F_q$.

For given linear action of a finite group on a lattice and a positive integer q, we prove that the mod q permutation representation is a quasi-polynomial in q. Additionally, we establish several results that can be considered as mod…

We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

A hyperoval in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ is a set of $q+2$ points no three of which are collinear. Hyperovals have been studied extensively since the 1950s with the ultimate goal of establishing a complete…

We study rational functions over finite fields under PGL-equivalence. We say that $f, g \in \Bbb F_q(X)$ are \emph{equivalent} if there exist $\psi, \phi \in \Bbb F_q(X)$ of degree one such that $g = \psi \circ f \circ \phi$. Most…

In this paper, as an extension of the integer case, we define polynomial functions over the residue class rings of Dedekind domains, and then we give canonical representations and counting formulas for such polynomial functions. In…

We give, in this paper, all bi-unitary perfect polynomials over the prime field $\mathbb{F}_2$, with at most four irreducible factors.

In this work, we completely characterize (i) permutation binomials of the form $x^{{{2^n -1}\over {2^t-1}}+1}+ ax \in \mathbb{F}_{2^n}[x], n = 2^st, a \in \mathbb{F}_{2^{2t}}^{*}$, and (ii) permutation trinomials of the form…

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

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…