Related papers: Counting roots of fully triangular polynomials ove…

For any positive integer n, a new family of periodic functions in power series form and of period n is used to solve in closed form a class of polynomial equation of order n. The n roots are the values of the appropriate function from that…

In this paper we investigate the following related problems: (A) the separation of $p$-adic roots of integer polynomials of a fixed degree and bounded height; and (B) counting integer polynomials of a fixed degree and bounded height with…

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

We investigate the analogues, in $\mathbb{F}_q[t]$, of highly composite numbers and the maximum order of the divisor function, as studied by Ramanujan. In particular, we determine a family of highly composite polynomials which is not too…

Let $f$ be a polynomial system consisting of $n$ polynomials $f_1,\cdots, f_n$ in $n$ variables $x_1,\cdots, x_n$, with coefficients in $\mathbb{Q}$ and let $\langle f\rangle$ be the ideal generated by $f$. Such a polynomial system, which…

We obtain estimates on the number $|\mathcal{A}_{\boldsymbol{\lambda}}|$ of elements on a linear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $n$ having factorization pattern…

We call a polynomial monogenic if a root $\theta$ has the property that $\mathbb{Z}[\theta]$ is the full ring of integers in $\mathbb{Q}(\theta)$. Consider the two families of trinomials $x^n + ax + b$ and $x^n + cx^{n-1} + d$. For any…

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…

In this paper, we study a Lienard system of the form dot{x}=y-F(x), dot{y}=-x, where F(x) is an odd polynomial. We introduce a method that gives a sequence of algebraic approximations to the equation of each limit cycle of the system. This…

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

The intersection distribution of a polynomial $f$ over finite field $\mathbb{F}_q$ was recently proposed in Li and Pott (arXiv:2003.06678v1), which concerns the collective behaviour of a collection of polynomials $\{f(x)+cx \mid c \in…

Let $s_0,s_1,\dots,s_{m-1}$ be complex numbers and $r_0,\dots,r_{m-1}$ rational integers in the range $0\le r_j\le m-1$. Our first goal is to prove that if an entire function $f$ of sufficiently small exponential type satisfies…

Let $f$ be an irreducible polynomial of prime degree $p\geq 5$ over $\QQ$, with precisely $k$ pairs of complex roots. Using a result of Jens H\"{o}chsmann (1999), we show that if $p\geq 4k+1$ then $\Gal(f/\QQ)$ is isomorphic to $A_{p}$ or…

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

For any $n\geq 1$, let $T_n$ be the complete binary rooted tree of height $n$, and $f(x)=(x+a)^2-a-1$ such that $a\neq \pm b^2$ for any $b\in \mathbb{Z}$. In \cite{Settled}, Jones and Boston empirically observed that iteratively applying a…

In recent years, several efforts have focused on identifying new families of scattered polynomials. Currently, only three families in $\mathbb{F}_{q^n}[X]$ are known to exist for infinitely many values of $n$ and $q$: (i) pseudoregulus-type…

A unitary cyclotomic polynomial of order three is a polynomial of the form \[ \Phi^*_{PQR}(x)=\frac{(x^{PQR}-1)(x^P-1)(x^Q-1)(x^R-1)}{(x^{PQ}-1)(x^{QR}-1)(x^{RP}-1)(x-1)}, \] where $P$, $Q$ and $R$ are powers of three distinct primes $p$,…