Related papers: Construction of irreducible polynomials through ra…

This paper considers permutation polynomials over the finite field $F_{q^2}$ in even characteristic by utilizing low-degree permutation rational functions over $F_q$. As a result, we obtain two classes of permutation binomials and six…

Let $\mathbb{F}$ denote an algebraically closed field with characteristic $0$, and let $q$ denote a nonzero scalar in $\mathbb{F}$ that is not a root of unity. Let $\mathbb{Z}_4$ denote the cyclic group of order $4$. Let $\square_q$ denote…

We construct new families of U_q(gl_n)-modules by continuation from finite dimensional representations. Each such module is associated with a combinatorial object - admissible set of relations defined in \cite{FRZ}. More precisely, we prove…

In this paper we discuss the permutational property of polynomials of the form $f(L(x))+k(L(x))\cdot M(x)\in \mathbb F_{q^n}[x]$ over the finite field $\mathbb F_{q^n}$, where $L, M\in \mathbb F_q[x]$ are $q$-linearized polynomials. The…

Let $q$ be a power of a prime, let $\mathbb{F}_q$ be the finite field with $q$ elements and let $n \geq 2$. For a polynomial $h(x) \in \mathbb{F}_q[x]$ of degree $n \in \mathbb{N}$ and a subset $W \subseteq [0,n] := \{0, 1, \ldots, n\}$, we…

Permutation rational functions over finite fields have attracted much attention in recent years. In this paper, we introduce a class of permutation rational functions over $\mathbb F_{q^2}$, whose numerators are so-called $q$-quadratic…

Jakhar shown that for $f(x)=a_nx^n + a_{n-1}x^{n-1}+\cdot+ a_0$ ($a_0\neq 0$) is a polynomial with rational coefficients, if there exists a prime integer $p$ satisfying $\nu_p(a_n)=0$ and $n\nu_p(a_i)\ge (n-i)\nu_p(a_0)> 0$ for every $0\le…

For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

In this paper we construct infinite sequences of monic irreducible polynomials with coefficients in odd prime fields by means of a transformation introduced by Cohen in 1992. We make no assumptions on the coefficients of the first…

We give iterative constructions for irreducible polynomials over F_q of degree nt^r for all nonnegative integers r, starting from irreducible polynomials of degree n. The iterative constructions correspond modulo fractional linear…

Let $q$ be an odd prime power and $\mathbb{F}_q$ be the finite field of $q$ elements. We define the Rudin-Shapiro function $R$ on monic polynomials $f=t^n+f_{n-1}t^{n-1}+\dots + f_0\in\mathbb{F}_q[t]$ over $\mathbb{F}_q$ by $$…

Let $\F_q$ be a finite field of characteristic $p>0$. We prove that, given $F(t,x)\in \F_q[t][x]$ an irreducible separable monic polynomial in the variable $x$ and a generic monic polynomial $\phi(t)$ in the variable $t$, the polynomial…

For an integer $r$, a prime power $q$, and a polynomial $f$ over a finite field ${\mathbb F}_{q^r}$ of $q^r$ elements, we obtain an upper bound on the frequency of elements in an orbit generated by iterations of $f$ which fall in a proper…

Let $k \geq 2$, $q$ be an odd prime power, and $F \in \mathbb{F}_q[x_1, \ldots, x_k]$ be a polynomial. An $F$-Diophantine set over a finite field $\mathbb{F}_q$ is a set $A \subset \mathbb{F}_q^*$ such that $F(a_1, a_2, \ldots, a_k)$ is a…

Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

We provide some statistics about an irreducibility/reducibility test for multivariate polynomials over finite fields based on counting points. The test works best for polynomials in a large number of variables and can also be applied to…

Let $f(T)$ be a monic polynomial of degree $d$ with coefficients in a finite field $\mathbb{F}_q$. Extending earlier results in the literature, but now allowing $(q,2d)>1$, we give a criterion for $f$ to satisfy the following property: for…