Metraipolis › archive › dc_78ec94847bd7
The exponent of harmonic LCM avoidance — arXiv:2609.07268
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.07268
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:48:45.448Z
- SHA-256 of the archived text
9ac02f8ff0ca4a0028eac3b44fd1a27acf3f2a6e5d9978d21481cae1ea76baff- Stable URL of this page
https://metraipolis.com/documento/dc_78ec94847bd7
How to cite
The exponent of harmonic LCM avoidance — arXiv:2609.07268 — arXiv (en), https://arxiv.org/abs/2609.07268 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_78ec94847bd7 (Metraipolis archive dc_78ec94847bd7, sha256 9ac02f8ff0ca4a0028eac3b44fd1a27acf3f2a6e5d9978d21481cae1ea76baff)
BibTeX
@misc{dc78ec94847bd7,
title = {The exponent of harmonic LCM avoidance — arXiv:2609.07268},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.07268},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_78ec94847bd7; sha256 9ac02f8ff0ca4a0028eac3b44fd1a27acf3f2a6e5d9978d21481cae1ea76baff},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.07268. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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)^{\gamma_k+o(1)}$ for a well-defined exponent $\gamma_k\in(0,1]$. Following the weighted-pressure idea of Chojecki, we give a self-contained proof of variational formulas for $\gamma_k$ in terms of weighted sunflower-free families. We then eliminate the continuous weight: if $M_k(n,r)$ is the largest size of an $r$-uniform $k$-cosunflower-free family on $[n]$, then \[ \gamma_k=\sup_{n\ge1,\ 1\le r\le n}\frac{r}{en}M_k(n,r)^{1/r}. \] This finite-block formula yields a direct transfer principle from uniform set-system constructions, recovers the Tang--Zhang bounds, and gives $0.438899\ldots<\gamma_3\le0.889881\ldots$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2609.07268 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:32:29.817Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).