Explicit Improvements to the Burgess Bound Via Pólya-Vinogradov

Matteo Bordignon, Forrest Francis

备注：: 18 pages, comments welcome

英文摘要：

We make explicit a theorem of Fromm and Goldmakher [arXiv:1706.03002], which states that one can improve Burgess' bound for short character sums simply by improving the leading constant in the Pólya-Vinogradov inequality. Towards achieving this, we establish explicit versions of several estimates related to the mean values of real multiplicative functions and the Dickman function.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Improving the Burgess bound via Polya-Vinogradov

We show that even mild improvements of the Polya-Vinogradov inequality would imply significant improvements of Burgess' bound on character sums. Our main ingredients are a lower bound on certain types of character sums (coming from works of the second author joint with J. Bober and Y. Lamzouri) and a quantitative relationship between the mean and the logarithmic mean of a completely multiplicative function.

2017-06-09math.NT

Burgess bounds for short mixed character sums

This paper proves nontrivial bounds for short mixed character sums by introducing estimates for Vinogradov's mean value theorem into a version of the Burgess method.

2014-04-07math.NT

Pólya-Vinogradov and the least quadratic nonresidue

It is well-known that cancellation in short character sums (e.g. Burgess' estimates) yields bounds on the least quadratic nonresidue. Scant progress has been made on short character sums since Burgess' work, so it is desirable to find a new approach to nonresidues. The goal of this note is to demonstrate a new line of attack via long character sums, a currently active area of research. Among other results, we demonstrate that improving the constant in the Pólya-Vinogradov inequality would lead to significant progress on nonresidues. Moreover, conditionally on a conjecture on long character sum…

2015-04-06math.NT

A note on medium and short character sums

Following the work of Hildebrand we improve the Po'lya- Vinogradov inequality in a specific range, we also give a general result that shows its dependency on Burgess bound and at last we improve the range of validity for a special case of Burgess' character sum estimate.

2023-03-03math.NT

Burgess bounds for multi-dimensional short mixed character sums

This paper proves Burgess bounds for short mixed character sums in multi-dimensional settings. The mixed character sums we consider involve both an exponential evaluated at a real-valued multivariate polynomial, and a product of multiplicative Dirichlet characters. We combine a multi-dimensional Burgess method with recent results on multi-dimensional Vinogradov Mean Value Theorems for translation-dilation invariant systems in order to prove character sum bounds in any dimension that recapture the Burgess bound in dimension 1. Moreover, we show that by embedding the given polynomial into an adv…

2016-01-18math.NT

Burgess bounds for short character sums evaluated at forms II: the mixed case

This work proves a Burgess bound for short mixed character sums in $n$ dimensions. The non-principal multiplicative character of prime conductor $q$ may be evaluated at any "admissible" form, and the additive character may be evaluated at any real-valued polynomial. The resulting upper bound for the mixed character sum is nontrivial when the length of the sum is at least $q^β$ with $β> 1/2 - 1/(2(n+1))$ in each coordinate. This work capitalizes on the recent stratification of multiplicative character sums due to Xu, and the resolution of the Vinogradov Mean Value Theorem in arbitrary dimension…

2021-05-26math.NT

更多相关论文收起更多论文

Partial Gaussian sums and the Pólya--Vinogradov inequality for primitive characters

In this paper we obtain a new fully explicit constant for the Pólya-Vinogradov inequality for primitive characters. Given a primitive character $χ$ modulo $q$, we prove the following upper bound \begin{align*} \left| \sum_{1 \le n\le N} χ(n) \right|\le c \sqrt{q} \log q, \end{align*} where $c=3/(4π^2)+o_q(1)$ for even characters and $c=3/(8π)+o_q(1)$ for odd characters, with explicit $o_q(1)$ terms. This improves a result of Frolenkov and Soundararajan for large $q$. We proceed, following Hildebrand, obtaining the explicit version of a result by Montgomery--Vaughan on partial Gaussian sums and…

2020-01-15math.NT

The Elliott-Halberstam conjecture implies the Vinogradov least quadratic nonresidue conjecture

For each prime $p$, let $n(p)$ denote the least quadratic nonresidue modulo $p$. Vinogradov conjectured that $n(p) = O(p^\eps)$ for every fixed $\eps>0$. This conjecture follows from the generalised Riemann hypothesis, and is known to hold for almost all primes $p$ but remains open in general. In this paper we show that Vinogradov's conjecture also follows from the Elliott-Halberstam conjecture on the distribution of primes in arithmetic progressions, thus providing a potential "non-multiplicative" route to the Vinogradov conjecture. We also give a variant of this argument that obtains bounds …

2015-01-13math.NT