The Erdös discrepancy problem (Q2826233)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Erdös discrepancy problem |
scientific article; zbMATH DE number 6637036
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Erdös discrepancy problem |
scientific article; zbMATH DE number 6637036 |
Statements
10 October 2016
0 references
discrepancy
0 references
Erdős discrepancy problem
0 references
completely multiplicative functions
0 references
Elliott conjecture
0 references
Dirichlet characters
0 references
0 references
0 references
0 references
0 references
The Erdös discrepancy problem (English)
0 references
The main result in this paper is the following. Let \(H\) be a real or complex Hilbert space with norm \(\| \cdot \|_{H}\), and let \(f\) be a function defined on the positive integers \(\mathbb{N}\) such that \(\| f(n) \|_{H}=1\) for every \(n\in\mathbb{N}\). Then the discrepancy of \(f\), defined as NEWLINE\[CARRIAGE_RETURNNEWLINE\sup_{n,d\in\mathbb{N}}\left\| \sum_{j=1}^n f(jd) \right\|_{H},CARRIAGE_RETURNNEWLINE\]NEWLINE is infinite. As a special case, if \(f\) is a function taking values in \(\{-1,+1\}\), this result is the answer to an open question originally posed by Erdős, therefore known as the Erdős discrepancy problem.NEWLINENEWLINEThe proof of this theorem is based on a logarithmically averaged version of the Elliott conjecture, also recently shown by the author of this paper, and results obtained in the so-called \texttt{Polymath5} project.
0 references