An Upper Bound for the Sum ∑ a + H n = a + 1 f(n) for a Certain Class of Functions f (Q3987955)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.

scientific article; zbMATH DE number 31912
Language Label Description Also known as
default for all languages
No label defined
    English
    An Upper Bound for the Sum ∑ a + H n = a + 1 f(n) for a Certain Class of Functions f
    scientific article; zbMATH DE number 31912

      Statements

      An Upper Bound for the Sum ∑ a + H n = a + 1 f(n) for a Certain Class of Functions f (English)
      0 references
      0 references
      0 references
      28 June 1992
      0 references
      Pólya-Vinogradov character sum estimate
      0 references
      The authors give a new proof of the classical Pólya-Vinogradov character sum estimate presented here in the form \[ |\sum^{a+H}_{n=a+1}\chi(n)|\leq{\sqrt k\log k\over 2 \log 2}+3\sqrt k,\quad \chi\bmod k,\quad \chi\neq\chi_ 0. \tag{*} \] It should be noted that their argument does not require the value of the modulus of the corresponding Gauss sum for a primitive character \(\chi\bmod k\). The proof starts from the inequality \[ \sum^ k_{n=1}|\sum^ h_{r=1}\chi(n+r)|^ 2\leq hk,\quad h\in\mathbb{N}, \tag{**} \] due to Burgess. Many values of \(h\) are chosen so that relatively many of the inner sums in (**) are partial sums of the sum (*) and can be combined to cover most of the range of summation of (*) a considerable number of times. An application of Cauchy's inequality then gives the stated bound. Modelling this method it is possible to obtain similar results for a more general class of functions.
      0 references

      Identifiers