Related papers: Counting polynomials over finite fields with given…
Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In this paper, we construct several new classes of permutation…
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…
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 propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…
A mathematically rigorous Hamiltonian formulation for classical and quantum field theories is given. New results include clarifications of the structure of linear fields, and a plausible formulation for nonlinear fields. Many mathematical…
Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…
Working over the split octonions over an algebraically closed field, we solve all polynomial equations in which all the coefficients but the constant term are scalar. As a consequence, we calculate the n-th roots of an octonion.
Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…
We present an example of a result in graph theory that is used to obtain a result in another branch of mathematics. More precisely, we show that the isomorphism of certain directed graphs implies that some trinomials over finite fields have…
We show the finiteness of perfect powers in orbits of polynomial dynamical systems over an algebraic number field. We also obtain similar results for perfect powers represented by ratios of consecutive elements in orbits. Assuming the…
We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most $d$. For this, we interpret the basis polynomials as vector…
The notion of symmetry in polynomial rings with several indeterminates is generalized to polynomial rings over finite fields. Families of extensions of the projective line over a finite field of constants possessing this property are…
We study Grothendieck rings (in the sense of logic) of fields. We prove the triviality of the Grothendieck rings of certain fields by constructing definable bijections which imply the triviality. More precisely, we consider valued fields,…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
Most results on the value sets $V_f$ of polynomials $f \in \mathbb{F}_q[x]$ relate the cardinality $|V_f|$ to the degree of $f$. In particular, the structure of the spectrum of the class of polynomials of a fixed degree $d$ is rather well…
Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
In this paper we consider estimating the number of solutions to multiplicative equations in finite fields when the variables run through certain sets with high additive structure. In particular, we consider estimating the multiplicative…
We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…