REVIEW
On a Tur\'an conjecture and random multiplicative functions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We show that if $f$ is the random completely multiplicative function, the probability that $\sum_{n\le x}\frac{f(n)}{n}$ is positive for every $x$ is at least $1-10^{-45}$, while also strictly smaller than $1$. For large $x$, we prove an asymptotic upper bound of $O(\exp(-\exp( \frac{\log x}{C\log \log x })))$ on the exceptional probability that a particular truncation is negative, where $C$ is some positive constant.
Discussion (0). Continue with ORCID to comment.