Related papers: Iteration of Quadratic Polynomials Over Finite Fie…

We construct Lagrange interpolating polynomials for a set of points and values belonging to the algebra of real quaternions $H\simeq R_{0,2}$, or to the real Clifford algebra $R_{0,3}$. In the quaternionic case, the approach by means of…

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…

In 1986, some examples of algebraic, and nonquadratic, power series over a finite prime field, having a continued fraction expansion with partial quotients all of degree one, were discovered by W. Mills and D. Robbins. In this note we show…

For $q$ an odd prime power with $q>169$ we prove that there are always three consecutive primitive elements in the finite field $\mathbb{F}_{q}$. Indeed, there are precisely eleven values of $q \leq 169$ for which this is false. For $4\leq…

Let $q>2$ be a prime power and $f={\tt x}^{q-2}+t{\tt x}^{q^2-q-1}$, where $t\in\Bbb F_q^*$. It was recently conjectured that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following holds: (i) $t=1$, $q\equiv…

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 obtain new explicit formulas for the recurrence coefficients of the q-orthogonal polynomial sequences in a class that extends the q-Askey scheme. Our formulas express the recurrence coefficients in terms of four parameters that determine…

We present an algorithm to perform a simultaneous modular reduction of several residues. This algorithm is applied fast modular polynomial multiplication. The idea is to convert the $X$-adic representation of modular polynomials, with $X$…

We exhibit an explicit formula for the cardinality of solutions to a class of quadratic matrix equations over finite fields. We prove that the orbits of these solutions under the natural conjugation action of the general linear groups can…

Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…

For a subgroup of $PGL(2,q)$ we show how some irreducible polynomials over $\mathbb{F}_q$ arise from the field of invariant rational functions. The proofs rely on two actions of $PGL(2,F)$, one on the projective line over a field $F$ and…

Using matrix iterations of ccc posets, we prove the consistency with ZFC of some cases where the cardinals on the right hand side of Cichon's diagram take two or three arbitrary values (two regular values, the third one with uncountable…

Permutation polynomials over finite fields are an interesting subject due to their important applications in the areas of mathematics and engineering. In this paper we investigate the trinomial $f(x)=x^{(p-1)q+1}+x^{pq}-x^{q+(p-1)}$ over…

Let $q = p^s$ be a power of a prime number $p$ and let $\mathbb{F}_q$ be the finite field with $q$ elements. In this paper we obtain the explicit factorization of the cyclotomic polynomial $\Phi_{2^nr}$ over $\mathbb{F}_q$ where both $r…

We develop techniques for computing the AK invariant of domains with arbitrary characteristic. As an example, we show that for any field $K$ the ring $K[X,Y,Z,T] / (X + X^2 Y + Z^2 + T^3)$ is not isomorphic to a polynomial ring over $K$.

Given an odd prime $q$, a natural number $l$ and non-zero $q$-free integers $a_{1}, a_{2}, \ldots, a_{l}$, none of which are equal to $1$ or $-1$, we give necessary and sufficient conditions for the polynomial $\prod_{j=1}^{l} (x^{q} -…

Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…

An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such…

For a root system R, a field K and an invertible element q in K let U be the associated quantum group, defined via Lusztig's divided powers construction. We study the irreducible characters of this algebra with integral (but not necessarily…