arXiv (All)
open access
The exponent of harmonic LCM avoidance
Fix $k\ge 3$, and let $f_k(N)$ be the largest harmonic sum of a subset of $[N]$ containing no $k$ distinct integers with a common pairwise least common multiple. We prove that $f_k(N)=(\log N)^{γ_k+o(1)}$ for a well-defined exponent $γ_k\in(0,1]$. Following the weighted-pressure idea of Chojecki, we
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
- Algorithmic number theory, Vol. 1: Efficient algorithms#490163
- Eleven, twelve, and thirteen lonely runners#819353
- Eleven, twelve, and thirteen lonely runners#809360
- Spectral synthesis with the complexity parameter in $\mathbb{Z}_N^d$#1051897
- NP-Hardness of Bounded Distance Decoding for Reed-Solomon Codes#1077049
Record · ID 975319
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