The frequency and the structure of large character sums (Q1644493)

From MaRDI portal
Revision as of 15:48, 24 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The frequency and the structure of large character sums
scientific article

    Statements

    The frequency and the structure of large character sums (English)
    0 references
    0 references
    0 references
    0 references
    21 June 2018
    0 references
    Let \(q\) be an odd prime, and let \(\chi\) be a non-principal Dirichlet character modulo \(q\). Define \[ M(\chi)=\max_{1\leq x\leq q}\left|\sum_{n\leq x}\chi(n)\right|, \] and let \(N_{\chi}\) denote a point at which the maximum is attained. This paper proved that the distribution of \(M(\chi)/\sqrt{q}\) converses weakly to a universal distribution \(\Phi\), uniformly throughout most of the possible range, and got estimates for \(\Phi\)'s tail. The paper also showed that for most \(\chi\) with \(M(\chi)\) large, \(N_{\chi}\) is bounded away from \(q/2\), and the value of \(M(\chi)\) is little larger than \(\left(\sqrt{q}/\pi\right)|L(1,\chi)|\).
    0 references
    distribution of character sums
    0 references
    distribution of Dirichlet \(L\)-functions
    0 references
    pretentious multiplicative functions
    0 references
    random multiplicative functions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references