A short proof of Helson's conjecture

Abstract Let be the Steinhaus multiplicative function: a completely multiplicative function such that are i.i.d. random variables uniformly distributed on the complex unit circle . Helson conjectured that as , and this was solved in a strong form by Harper. We give a short proof of the conjecture using a result of Saksman and Webb on a random model for the zeta function.

Authors

Institutions

Publication Details

Journal
Bulletin of the London Mathematical Society
Published
2025-02-07
DOI
https://doi.org/10.1112/blms.70015
Citations
1
Primary Topic
Mathematics and Applications
Type
article
Field-Weighted Citation Impact
4.09

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A short proof of Helson's conjecture

Mo Dick Wong, Ofir Gorodetsky
1 citations
Bulletin of the London Mathematical Society
Mathematics and Applications
4.09
article

A short proof of Helson's conjecture

Mo Dick Wong, Ofir Gorodetsky
article en
1 citations

Abstract

Abstract Let be the Steinhaus multiplicative function: a completely multiplicative function such that are i.i.d. random variables uniformly distributed on the complex unit circle . Helson conjectured that as , and this was solved in a strong form by Harper. We give a short proof of the conjecture using a result of Saksman and Webb on a random model for the zeta function.

Bulletin of the London Mathematical SocietyVol. 57(4)
Technion – Israel Institute of Technology (IL), Durham University (GB)
European Research Council
Openalex Percentile: Top 13%
Mathematics and Applications
4.09
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.