arXiv (All)
open access
Effective logarithmic two-point Chowla bounds in every window
We quantify the entropy-decrement proof of the logarithmically averaged two-point Chowla theorem, uniformly in the affine forms and the averaging window. For L_i(n)=a_i n+b_i with positive integral slopes and nonzero determinant Delta=a_1 b_2-a_2 b_1, put h=max(a_1,a_2,|b_1|,|b_2|,|Delta|,2). For ei
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
- A finite victory over de Bruijn-Erdős in interval discrepancy#1076089
- P3.14 Recursive Reality Project - A Complete Proof of the Interference Dimension Law#89235
- Quantum data processing equality#1118888
- The two-block odd partition function#1118843
- Turán problem on the union of three intervals of equal length#616793
Record · ID 1076183
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