Related papers: Counting roots of fully triangular polynomials ove…

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

For each prime power q, we determine all polynomials over F_{q^2} of the form f(X) := aX^{3q}+bX^{2q+1}+cX^{q+2}+dX^3 which induce complete mappings of F_{q^2}, in the sense that each of the functions x --> f(x) and x --> f(x)+x permutes…

We consider natural polynomial truncations of hypergeometric power series defined over finite fields. For these truncations, we establish asymptotic upper bounds of order $O(p^{11/12})$ on the number of roots in the prime field…

Linearized polynomials have attracted a lot of attention because of their applications in both geometric and algebraic areas. Let $q$ be a prime power, $n$ be a positive integer and $\sigma$ be a generator of…

For a field $K$, and a root $\alpha$ of an irreducible polynomial over $K$ (in some algebraic closure) the number of roots of $f(x)$ lying in $K(\alpha)$ is studied here. Given such an $f(x)$ of degree $n$ for which $r$ of the roots are i n…

It is well known that a polynomial $\phi(X)\in \mathbb{Z}[X]$ of given degree $d$ factors into at most $d$ factors in $\mathbb{F}_p$ for any prime $p$. We prove in this paper the existence of infinitely many primes $q$ so that the given…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented…

Let $p$ be a prime number, $m$ be an even positive integer, and $\mathbb{F}_q$ be a finite field with $q = p^m$ elements. In this paper, we compute the number of solutions with all coordinates in $\mathbb{F}_q^*$ for diagonal equations of…

Permutation polynomials are of particular significance in several areas of applied mathematics, such as Coding theory and Cryptography. Many recent constructions are based on the Akbary-Ghioca-Wang (AGW) criterion. Along this line of…

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

This part is made of three sections. In the first section we study the family of polynomials whose roots are 4cos2 k{\pi}, (n \geqslant 3,1 \leqslant k < \frac{n}{2}). We obtain n2 in this manner a family of orthogonal polynomials. This…

Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot…

For any given polynomial $f$ over the finite field $\mathbb{F}_q$ with degree at most $q-1$, we associate it with a $q\times q$ matrix $A(f)=(a_{ik})$ consisting of coefficients of its powers $(f(x))^k=\sum_{i=0}^{q-1}a_{ik} x^i$ modulo…

We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…

We find a formula for the number of permutation polynomials of degree q-2 over a finite field Fq, which has q elements, in terms of the permanent of a matrix. We write down an expression for the number of permutation polynomials of degree…

Let $\mathbb{F}_q$ denote the finite field of $q$ elements and $\mathbb{F}_{q^n}$ the degree $n$ extension of $\mathbb{F}_q$. A normal basis of $\mathbb{F}_{q^n}$ over $\mathbb{F} _q$ is a basis of the form…

Let $q$ be a power of a prime $p$, let $\mathbb F_q$ be the finite field with $q$ elements and, for each nonconstant polynomial $F\in \mathbb F_{q}[X]$ and each integer $n\ge 1$, let $s_F(n)$ be the degree of the splitting field (over…

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…