The author proves f(N) ≫ N exp(−(2√(log(24/7))+o(1))√(log log N)) for the largest harmonic-triple-free subset of [N], matching the form of the best 3-AP-free lower bound with log N replaced by log log N.
Title resolution pending
1 Pith paper cite this work, alongside 433 external citations. Polarity classification is still indexing.
1
Pith paper citing it
433
external citations · OpenAlex
fields
math.NT 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Large Sets of Integers with No Harmonic Triples
The author proves f(N) ≫ N exp(−(2√(log(24/7))+o(1))√(log log N)) for the largest harmonic-triple-free subset of [N], matching the form of the best 3-AP-free lower bound with log N replaced by log log N.