Gaps in Multiplicative Sidon Sets

TL;DR

This paper investigates the size of the smallest interval length that guarantees a multiplicative Sidon set intersects it, proving bounds that confirm and improve upon a conjecture by Sárközy.

Contribution

The authors proved Sárközy's conjecture that g(n) ≤ √n and further established a tighter upper bound of n^{0.47+ε} for the size of such intervals.

Findings

Confirmed g(n) ≤ √n for all n, resolving Sárközy's question.

Improved the upper bound to g(n) ≪ n^{0.47+ε} for any ε > 0.

Proofs were independently discovered and verified in Lean.

Abstract

For a positive integer $n$, let $g(n)$ denote the infimum of all real numbers $L$ such that there exists a multiplicative Sidon set $A\subseteq\{1,2,\dots,n\}$ that intersects every interval $[x,x+L]\subseteq[1,n]$. S\'ark\"ozy asked for estimates on $g(n)$, and he in particular asked whether one has $g(n)\le\sqrt n$ for every $n\in\mathbb{N}$. We first show that this estimate does indeed hold, with a proof that was autonomously discovered and formally verified in Lean by Aristotle. Next, we improve the upper bound further and, with $\rho = \frac{13-\sqrt{69}}{10} < 0.47$, prove that $g(n)\ll_{\varepsilon} n^{\rho+\varepsilon}$ for every $\varepsilon > 0$.