The Erdős discrepancy problem
From MaRDI portal
Publication:2826233
DOI10.19086/da.609zbMath1353.11087arXiv1509.05363OpenAlexW2963427894WikidataQ57307586 ScholiaQ57307586MaRDI QIDQ2826233
Publication date: 10 October 2016
Published in: Discrete Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05363
discrepancyDirichlet characterscompletely multiplicative functionsErdős discrepancy problemElliott conjecture
Irregularities of distribution, discrepancy (11K38) Arithmetic functions in probabilistic number theory (11K65)
Related Items (31)
Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences ⋮ About Erdös discrepancy conjecture ⋮ Discrepancy in modular arithmetic progressions ⋮ Pisot substitution sequences, one dimensional cut-and-project sets and bounded remainder sets with fractal boundary ⋮ Equivalence of the Logarithmically Averaged Chowla and Sarnak Conjectures ⋮ Divisor-bounded multiplicative functions in short intervals ⋮ The Erdős discrepancy problem over the squarefree and cubefree integers ⋮ The upper logarithmic density of monochromatic subset sums ⋮ Correlations of multiplicative functions in function fields ⋮ Tao’s resolution of the Erdős discrepancy problem ⋮ Discrepancy theory and related algorithms ⋮ THE LOGARITHMICALLY AVERAGED CHOWLA AND ELLIOTT CONJECTURES FOR TWO-POINT CORRELATIONS ⋮ Correlations of multiplicative functions along deterministic and independent sequences ⋮ Quantifying local randomness in human DNA and RNA sequences using Erdös motifs ⋮ Zero-sum subsequences in bounded-sum \(\{-r,s\}\)-sequences ⋮ From the 1-2-3 conjecture to the Riemann hypothesis ⋮ Mini-workshop: Interplay between number theory and analysis for Dirichlet series. Abstracts from the mini-workshop held October 29 -- November 4, 2017 ⋮ Zero-sum squares in bounded discrepancy \(\{-1,1\}\)-matrices ⋮ Are Monochromatic Pythagorean Triples Unavoidable under Morphic Colorings? ⋮ Multiplicative functions that are close to their mean ⋮ The twin prime conjecture ⋮ Rigidity theorems for multiplicative functions ⋮ Chang's lemma via Pinsker's inequality ⋮ Good weights for the Erd\H{o}s discrepancy problem ⋮ Riesz means of certain arithmetic functions ⋮ A note on multiplicative functions resembling the Möbius function ⋮ Correlations of multiplicative functions and applications ⋮ Incompleteness, Undecidability and Automated Proofs ⋮ Multiplicative functions supported on the \(k\)-free integers with small partial sums ⋮ Complex valued multiplicative functions with bounded partial sums ⋮ Additive functions in short intervals, gaps and a conjecture of Erdős
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplicative functions in short intervals
- Computer-aided proof of Erdős discrepancy properties
- Chains of large gaps between consecutive primes
- Completely multiplicative functions taking values in ${-1,1}$
- Patterns and complexity of multiplicative functions
- On Character Sums and Primitive Roots†
- Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
- Erdős and Arithmetic Progressions
This page was built for publication: The Erdős discrepancy problem
