English
Related papers

Related papers: A note on exponential-M\"{o}bius sums over $\mathb…

200 papers

A discussion involving the evaluation of the sum $\sum_{0<\gamma\le T} |\zeta(1/2+i\gamma)|^2$ is presented, where $\gamma$ denotes imaginary parts of complex zeros of the Riemann zeta-function $\zeta(s)$. Three theorems involving certain…

Number Theory · Mathematics 2007-05-23 Aleksandar Ivić

Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural…

Number Theory · Mathematics 2013-02-27 Sadegh Nazardonyavi , Semyon Yakubovich

We prove a lower bound on the maximum of the Riemann zeta function in a typical short interval on the critical line. Together with the upper bound from the previous work of the authors, this implies tightness of $$ \max_{|h|\leq…

Number Theory · Mathematics 2023-07-04 Louis-Pierre Arguin , Paul Bourgade , Maksym Radziwiłł

In this paper, we present a more complete version of the minimax theorem established in [7]. As a consequence, we get, for instance, the following result: Let $X$ be a compact, not singleton subset of a normed space $(E,\|\cdot\|)$ and let…

Functional Analysis · Mathematics 2021-04-13 Biagio Ricceri

We study large values of quadratic character sums with summation lengths exceeding the square root of the modulus. Assuming the Generalized Riemann Hypothesis, we obtain a new Omega result.

Number Theory · Mathematics 2026-01-01 Zikang Dong , Ruihua Wang , Weijia Wang , Hao Zhang

A number of authors have proven explicit versions of Lehmer's conjecture for polynomials whose coefficients are all congruent to 1 modulo m. We prove a similar result for polynomials f(X) that are divisible in (Z/mZ)[X] by a polynomial of…

Number Theory · Mathematics 2010-08-24 Joseph H. Silverman

For a given transcendental number $\xi$ and for any polynomial $P(X)=: \lambda_0+\cdots+\lambda_k X^k \in \mathbb{Z}[X]$, we know that $ P(\xi) \neq 0.$ Let $k \geq 1$ and $\omega (k, H)$ be the infimum of the numbers $r > 0$ satisfying the…

Number Theory · Mathematics 2023-03-13 Marta Dujella , Anne-Maria Ernvall-Hytönen , Linda Frey , Bidisha Roy

Paul Erdos and Carl Pomerance have proofs on an asymptotic upper bound on the number of preimages of Euler's totient function $\phi$ and the sum-of-divisors functions $\sigma$. In this paper, we will extend the upper bound to the number of…

Number Theory · Mathematics 2024-01-09 Agbolade Patrick Akande

In this work, we prove that the universal and maximal abelian covers of a finite multi-graph have the same eigenvalues. This result strengthens a recent theorem of Li, Magee, Sabri, and Thomas (2025) and answers one of their questions. Our…

Combinatorics · Mathematics 2025-10-29 Thomás Jung Spier

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

Number Theory · Mathematics 2016-11-23 Adrian Dudek

Recently, an analogue over $\mathbb{F}_q[T]$ of Landau's theorem on sums of two squares was considered by Bary-Soroker, Smilansky and Wolf. They counted the number of monic polynomials in $\mathbb{F}_q[T]$ of degree $n$ of the form…

Number Theory · Mathematics 2024-11-20 Ofir Gorodetsky

Let $w$ be any word over the alphabet $\{0,1,\ldots, q-1\}$, and denote by $h$ either a polynomial of degree $d\geq 1$ or $h: n\mapsto m^n$ for a fixed $m$. Furthermore, denote by $e_q(w;h(n))$ the number of occurrences of $w$ as a subword…

Number Theory · Mathematics 2017-07-06 Hajime Kaneko , Thomas Stoll

In 1935, Erd\H{o}s proved that the sums $f_k=\sum_n 1/(n\log n)$, over integers $n$ with exactly $k$ prime factors, are bounded by an absolute constant, and in 1993 Zhang proved that $f_k$ is maximized by the prime sum $f_1=\sum_p 1/(p\log…

Number Theory · Mathematics 2024-12-02 Ofir Gorodetsky , Jared Duker Lichtman , Mo Dick Wong

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…

Number Theory · Mathematics 2020-09-22 Brandon Hanson , Oliver Roche-Newton , Dmitrii Zhelezov

We give a simple proof of a well-known theorem of G\'al and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in G\'al's theorem,…

Number Theory · Mathematics 2014-08-12 Mark Lewko , Maksym Radziwill

Using the recent proof of the polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p^n$ by Gowers, Green, Manners, and Tao, we prove a version of the polynomial Freiman-Ruzsa conjecture over function fields. In particular, we prove that if…

Number Theory · Mathematics 2025-10-09 Thomas F. Bloom

Let q be a prime, A be a subset of a finite field $F=\Bbb Z/q\Bbb Z$, $|A|<\sqrt{|F|}$. We prove the estimate $\max(|A+A|,|A\cdot A|)\ge c|A|^{1+\epsilon}$ for some $\epsilon>0$ and c>0. This extends the result of J. Bourgain, N. Katz, and…

Number Theory · Mathematics 2007-05-23 S. V. Konyagin

In the present paper, we show that under the Riemann hypothesis, and for fixed $h, \epsilon > 0$, the supremum of the real and the imaginary parts of $\log \zeta (1/2 + it)$ for $t \in [UT -h, UT + h]$ are in the interval $[(1-\epsilon)…

Number Theory · Mathematics 2018-04-03 Joseph Najnudel

Consider an expander graph in which a $\mu$ fraction of the vertices are marked. A random walk starts at a uniform vertex and at each step continues to a random neighbor. Gillman showed in 1993 that the number of marked vertices seen in a…

Probability · Mathematics 2017-08-25 Shravas Rao , Oded Regev

In his paper, W. M. Schmidt obtained an exponential sum estimate for systems of polynomials not including linear polynomials, which was then used to apply the Hardy-Littlewood circle method. We prove an analogous estimate for systems…

Number Theory · Mathematics 2016-07-29 Shuntaro Yamagishi