Related papers: On the degree of polynomials computing square root…

An open problem in complexity theory is to find the minimal degree of a polynomial representing the $n$-bit OR function modulo composite $m$. This problem is related to understanding the power of circuits with $\text{MOD}_m$ gates where $m$…

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

Let $p$ be an odd prime. In this paper we investigate quadratic residues modulo $p$ and related permutations, congruences and identities. If $a_1<\ldots<a_{(p-1)/2}$ are all the quadratic residues modulo $p$ among $1,\ldots,p-1$, then the…

Let $g^{\square}(p)$ denote the least square-free primitive root modulo $p$. We show that $g^{\square}(p)< p^{0.96}$ for all $p$.

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…

E. Bach, following an idea of T. Itoh, has shown how to build a small set of numbers modulo a prime p such that at least one element of this set is a generator of $\pF{p}$\cite{Bach:1997:sppr,Itoh:2001:PPR}. E. Bach suggests also that at…

In this paper, we prove tight lower bounds on the smallest degree of a nonzero polynomial in the ideal generated by $MOD_q$ or $\neg MOD_q$ in the polynomial ring $F_p[x_1, \ldots, x_n]/(x_1^2 = x_1, \ldots, x_n^2 = x_n)$, $p,q$ are…

This paper is motivated by the following question in sieve theory. Given a subset $X\subset [N]$ and $\alpha\in (0,1/2)$. Suppose that $|X\pmod p|\leq (\alpha+o(1))p$ for every prime $p$. How large can $X$ be? On the one hand, we have the…

Let $p$ be a prime, let $1 \le t < d < p$ be integers, and let $S$ be a non-empty subset of $\mathbb{F}_p$. We establish that if a polynomial $P:\mathbb{F}_p^n \to \mathbb{F}_p$ with degree $d$ is such that the image $P(S^n)$ does not…

Consider any nonzero univariate polynomial with rational coefficients, presented as an elementary algebraic expression (using only integer exponents). Letting sigma(f) denotes the additive complexity of f, we show that the number of…

We provide a direct computation of the $F$-pure threshold of degree four homogeneous polynomial in two variables and, more generally, of certain homogeneous polynomials with four distinct roots. The computation depends on whether the cross…

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

For any fixed field $K\!\in\!\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5, \ldots\}$, we prove that all polynomials $f\!\in\!\mathbb{Z}[x]$ with exactly $3$ (resp. $2$) monomial terms, degree $d$, and all coefficients having absolute value at…

We implement an iterative numerical method to solve polynomial equations $f(x)=0$ in the $p$-adic numbers, where $f(x) \in\mathbb{Z}_p[x]$. This method is a simplified $p$-adic analogue of Jarratt's method for finding roots of functions…

A landmark result from rational approximation theory states that $x^{1/p}$ on $[0,1]$ can be approximated by a type-$(n,n)$ rational function with root-exponential accuracy. Motivated by the recursive optimality property of Zolotarev…

We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…

We prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z|…

We study how well Fekete polynomials $$ F_p(X) = \sum_{n=0}^{p-1} \left(\frac{n}{p}\right) X^n \in {\mathbb Z}[X] $$ with the coefficients given by Legendre symbols modulo a prime $p$, can be approximated by power series representing…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…