Rankin's set conjecture for the maximal density of geometric-progression-free sets
Rankin's set conjecture for the maximal density of geometric-progression-free sets
Let denote Rankin's geometric-progression-free set, and let be its density. Let be the supremum of the densities of geometric-progression-free sets that possess a density.
Rankin's set conjecture. Rankin's set has the largest possible density among geometric-progression-free sets which have a density, so
The paper establishes an effective method for computing the maximal upper density of sets avoiding three-term geometric progressions, but the precise value of remains open. This conjecture is stronger than the question of whether is strictly smaller than the corresponding maximal upper density.
Sources & referencesView supporting material
Primary source
Nathan McNew, “On sets of integers which contain no three terms in geometric progression”, arXiv:1310.2277 (2013).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.