English
Related papers

Related papers: Polynomial values modulo primes on average and sha…

200 papers

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

Number Theory · Mathematics 2017-11-16 Jonathan Hickman , James Wright

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…

Optimization and Control · Mathematics 2024-07-25 Boulos El Hilany , Elias Tsigaridas

In this paper, we broaden Shiu's Brun-Titchmarsh theorem to allow for functions that are larger and/or smooth-supported. In particular, let $f$ be a nonnegative multiplicative function. We prove that if there exists a $\beta<1$ such that…

Number Theory · Mathematics 2025-09-26 Thomas Wright

TO BE PUBLISHED BY ISRAEL JOURNAL OF MATHEMATICS. We study the mean $\sum_{x\in\mathcal{X}} \bigl|\sum_{p\le N}{}u_p e(xp)\bigr|^{\ell}$ when $\ell$ covers the full range $[2,\infty)$ and $\mathcal{X}\subset\mathbb{R}/\mathbb{Z}$ is a…

Number Theory · Mathematics 2022-09-07 Olivier Ramaré

Let X be a normal complex algebraic variety, and p a prime. We show that there exists an integer N=N(X, p) such that: any non-trivial, irreducible representation of the fundamental group of X, which arises from geometry, must be non-trivial…

Algebraic Geometry · Mathematics 2016-12-22 Daniel Litt

We prove new bounds for how often Dirichlet polynomials can take large values. This gives improved estimates for a Dirichlet polynomial of length $N$ taking values of size close to $N^{3/4}$, which is the critical situation for several…

Number Theory · Mathematics 2026-04-09 Larry Guth , James Maynard

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

Number Theory · Mathematics 2011-08-26 Michael Coons

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

Number Theory · Mathematics 2017-04-28 Carlos D'Andrea , Alina Ostafe , Igor E. Shparlinski , Martin Sombra

For a fixed finite solvable group $G$ and number field $K$, we prove an upper bound for the number of $G$-extensions $L/K$ with restricted local behavior (at infinitely many places) and ${\rm inv}(L/K)<X$ for a general invariant $"{\rm…

Number Theory · Mathematics 2019-12-13 Brandon Alberts

We prove that for every $\varepsilon>0$ and a nonnegative integer $\omega$ there exist primes $p_1,p_2,\ldots,p_\omega$ such that for $n=p_1p_2\ldots p_\omega$ the height of the cyclotomic polynomial $\Phi_n$ is at least…

Number Theory · Mathematics 2016-06-27 Bartlomiej Bzdega

Let $A \subset \mathbb{Z}^d$ be a finite set. It is known that $NA$ has a particular size ($\vert NA\vert = P_A(N)$ for some $P_A(X) \in \mathbb{Q}[X]$) and structure (all of the lattice points in a cone other than certain exceptional…

Combinatorics · Mathematics 2023-07-18 Andrew Granville , George Shakan , Aled Walker

Let $f$ be a completely multiplicative function that assumes values inside the unit disc. We show that if $\sum_{n<x} f(n) \ll x/(\log x)^A$, $x>2$, for some $A>2$, then either $f(p)$ is small on average or $f$ pretends to be $\mu(n)n^{it}$…

Number Theory · Mathematics 2017-06-12 Dimitris Koukoulopoulos

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

Number Theory · Mathematics 2020-11-09 M. J. Uray

We consider absolutely irreducible polynomials $f \in Z[x,y]$ with $\deg_x(f)=m$, $\deg_y(f)=n$ and height $H$. We show that for any prime $p$ with $p>c_{mn} H^{2mn+n-1}$ the reduction $f \bmod p$ is also absolutely irreducible. Furthermore…

Number Theory · Mathematics 2007-05-23 Wolfgang M. Ruppert

Using the theory of Newton Polygons, we formulate a simple criterion for the Galois group of a polynomial to be ``large.'' For a fixed $\alpha \in \Q - \Z_{<0}$, Filaseta and Lam have shown that the $n$th degree Generalized Laguerre…

Number Theory · Mathematics 2007-05-23 Farshid Hajir

Let $\psi: A \to F\{\tau\}$ be a Drinfeld $A$-module over $F$ of rank 2 and without complex multiplication, where $A = {\mathbb{F}}_q[T]$, $F = {\mathbb{F}}_q(T)$, and $q$ is an odd prime power. For a prime $\mathfrak{p} = p A$ of $A$ of…

Number Theory · Mathematics 2020-02-25 Alina Carmen Cojocaru , Mihran Papikian

We establish various upper bounds on Type-I and Type-II shifted bilinear sums with Sali\'e sums modulo a large prime $q$. We use these bounds to study, for fixed integers $a,b\not \equiv 0 \bmod q$, the distribution ofsolutions to the…

Number Theory · Mathematics 2026-01-16 Igor E. Shparlinski , Yixiu Xiao

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \sigma(n)$ be the sum of divisors function. This note presents the first proof of the asymptotic formula for the average order $ \sum_{p\leq…

General Mathematics · Mathematics 2021-07-05 N. A. Carella

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

Number Theory · Mathematics 2018-02-21 Xianchang Meng