Related papers: Distribution of reducible polynomials with a given…

Let $\mathbb{F}_q$ be the finite field of $q$ elements. In this paper we obtain bounds on the following counting problem: given a polynomial $f(x)\in \mathbb{F}_q[x]$ of degree $k+m$ and a non-negative integer $r$, count the number of…

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…

Let $f(x)$ be a polynomial of degree $n \ge 1$ with real coefficients and let $X \ge 2$ and $\delta \ge 0$ be real numbers. Let $\|\cdot\|$ be the distance to the nearest integer. We obtain upper bounds for the number of solutions to the…

Let $f_1(x),\ldots,f_n(x)$ be some polynomials. The upper bound on the number of $x\in\mathbb F_p$ such that $f_1(x),\ldots,f_n(x)$ are roots of unit of order $t$ is obtained. This bound generalize the bound of the paper \cite{V-S} to the…

Let $p$ be a fixed prime, and let $v(a)$ stand for the exponent of $p$ in the prime factorization of the integer $a$. Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Write $S$ for the maximum of…

An irreducible polynomial $f\in\Bbb F_q[X]$ of degree $n$ is {\em normal} over $\Bbb F_q$ if and only if its roots $r, r^q,\dots,r^{q^{n-1}}$ satisfy the condition $\Delta_n(r, r^q,\dots,r^{q^{n-1}})\ne 0$, where…

We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct…

Let $N>1$ and let $\Phi_N(X,Y)\in\mathbb{Z}[X,Y]$ be the modular polynomial which vanishes precisely at pairs of $j$-invariants of elliptic curves linked by a cyclic isogeny of degree $N$. In this note we study the divisibility of the…

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n,$ where the coefficients $a_j,$ $j \in \{0,1,2,\cdots n\},$ may be complex. We impose some restriction on the coefficients of the real part of the given polynomial…

Consider a random polynomial $$ G_Q(x)=\xi_{Q,n}x^n+\xi_{Q,n-1}x^{n-1}+...+\xi_{Q,0} $$ with independent coefficients uniformly distributed on $2Q+1$ integer points $\{-Q, ..., Q\}$. Denote by $D(G_Q)$ the discriminant of $G_Q$. We show…

Building on the work of Arizmendi and Celestino (2021), we derive the $*$-distributions of polynomials in monotone independent and infinitesimally monotone independent elements. For non-zero complex numbers $\alpha$ and $\beta$, we derive…

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function…

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

Let $F(X)= \prod_{i=1}^k(a_iX+b_i)$ be a polynomial with $a_i, b_i$ being integers. Suppose the discriminant of $F$ is non-zero and $F$ is admissible. Given any natural number $N$, let $S(F,N)$ denotes those integers less than or equal to…

An integer-valued multiplicative function $f$ is said to be polynomially-defined if there is a nonconstant separable polynomial $F(T)\in \mathbb{Z}[T]$ with $f(p)=F(p)$ for all primes $p$. We study the distribution in coprime residue…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…