arXiv (All)
open access
On the cardinality of the exception set in Littlewood's discrete conjecture
Let $p$ be a prime, $d\ge 2$, $H\in [1,p)$, and $\ln\ln p = o(\ln H)$. We prove that $$ \min_{1\le n \le H} n \left\|\frac{a_1 n}{p}\right\|\ldots \left\|\frac{a_d n}{p}\right\| \approx \frac{1}{(\ln p)^{d-1} \ln H} $$ for "almost all" $a \in ({\Bbb Z} / p{\Bbb Z})^d$.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Nombres de Pisot, nombres de Salem et la conjecture de Lehmer#1144733
- A $(\log n)^{1/4}$ Bound for the Komlós Problem#986510
- Estimates for $L^p$ variants of Gowers norms#986538
- Effective estimates for exponential sums with multiplicative coefficients#998630
- Products of two elements of Granville's random model in residue classes#1141756
Record · ID 987923
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive