Further remarks on the inverse Littlewood conjecture

For a finite set $A\subset\mathbb{Z}$, write $\mathcal{L}(A)=\int_0^1|\sum_{a\in A}e^{2\pi iat}|\,dt$. We prove the uniform lower bound $\mathcal{L}(A)\ge(c_*-o(1))\log|A|$, where $c_*>0.2459209$ is explicit. We also establish an almost-covering inverse theorem for an explicit class of integer sets generated from dense separated blocks and long arithmetic block inflations by cyclic Sidon-fibre decompositions of arbitrary depth. If $A$ belongs to this class and $\mathcal{L}(A)\le K\log|A|$, then, for every $\varepsilon>0$, all but $\varepsilon|A|$ points are covered by boundedly many disjoint, linear-sized subsets of bounded doubling. The constants depend only on $K$, $\varepsilon$, and the fixed terminal-geometry parameters, and are independent of the decomposition depth, branching, moduli, and diameter. The same conclusion holds under high-order Freiman modelling. An accompanying Lean 4 formalization is available at: https://github.com/hxypqr/littlewood-constant-inverse

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-25
DOI
https://doi.org/10.5281/zenodo.22963544
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

Further remarks on the inverse Littlewood conjecture

Xiyu Hu
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
preprint

Further remarks on the inverse Littlewood conjecture

Xiyu Hu
preprint en

Abstract

For a finite set $A\subset\mathbb{Z}$, write $\mathcal{L}(A)=\int_0^1|\sum_{a\in A}e^{2\pi iat}|\,dt$. We prove the uniform lower bound $\mathcal{L}(A)\ge(c_*-o(1))\log|A|$, where $c_*>0.2459209$ is explicit. We also establish an almost-covering inverse theorem for an explicit class of integer sets generated from dense separated blocks and long arithmetic block inflations by cyclic Sidon-fibre decompositions of arbitrary depth. If $A$ belongs to this class and $\mathcal{L}(A)\le K\log|A|$, then, for every $\varepsilon>0$, all but $\varepsilon|A|$ points are covered by boundedly many disjoint, linear-sized subsets of bounded doubling. The constants depend only on $K$, $\varepsilon$, and the fixed terminal-geometry parameters, and are independent of the decomposition depth, branching, moduli, and diameter. The same conclusion holds under high-order Freiman modelling. An accompanying Lean 4 formalization is available at: https://github.com/hxypqr/littlewood-constant-inverse

Zenodo (CERN European Organization for Nuclear Research)
University of Chinese Academy of Sciences (CN)
Limits and Structures in Graph Theory
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.

Further remarks on the inverse Littlewood conjecture — Xiyu Hu · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS