相关论文: On the Coefficients of Primitive Normal polynomial…

We show under a mild hypothesis that given field elements $a_0, \dots, a_m \in K$, there always exists a degree-$m$ polynomial whose $n$th power whose degree-$jn$ coefficient is equal to $a_j$ for $0 \leq j \leq m$. We provide an alternate…

A polynomial whose coeffcients are equal to its roots is called a Ulam polynomial. In this paper we show that for a given degree n there exists a finite number of Ulam polynomials of degree n.

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Let $k \geq 2$ be an integer and $\mathbb F_q$ be a finite field with $q$ elements. We prove several results on the distribution in short intervals of polynomials in $\mathbb F_q[x]$ that are not divisible by the $k$th power of any…

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…

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these…

Let $\mathbb{F}_q$ be the finite field of $q$ elements, and let $k\mid q-1$ be a positive integer. Let $f(x)=ax^2+bx+c$ be a quadratic polynomial in $\mathbb{F}_q[x]$ with $b^2-4ac\ne0$. In this paper, we show that if…

Given a global field K and a polynomial f defined over K of degree at least two, Morton and Silverman conjectured in 1994 that the number of K-rational preperiodic points of f is bounded in terms of only the degree of K and the degree of f.…

Motivated by the work of Prajapati \emph{et al.} \cite{PAA}, here we study some explicit form of the generalized Laguerre polynomials $L_{\lfloor\frac{n}{q}\rfloor}^{(\alpha,\beta)}(z)$, when $q=1$.

In this article, we establish a sufficient condition for the existence of a primitive element $\alpha \in {\mathbb{F}_{q^n}}$ such that the element $\alpha+\alpha^{-1}$ is also a primitive element of ${\mathbb{F}_{q^n}},$ and…

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…

We present an elementary self-contained folkloristic proof, using limits of primitives of Bernstein polynomials, for the existence of primitive functions of continuous functions defined on the unit interval.

Given a prime power $q$ and an integer $n\geq2$, we establish a sufficient condition for the existence of a primitive pair $(\alpha,f(\alpha))$ where $\alpha \in \mathbb{F}_q$ and $f(x) \in \mathbb{F}_q(x)$ is a rational function of degree…

We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…

In this paper, we describe a congruence property of solvable polynomials with coefficients in the Gaussian field Q(i).

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 $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…