Avoidable-set lower-density conjecture
Let be an avoidable set of integers, and suppose that contains infinitely many even numbers. Write for its lower logarithmic density. Lower-density conjecture.
The preceding theorem proves the analogous bound for , while the conjecture asks for the same upper bound for . The source gives no resolution of this stronger assertion.
References
Primary source
Mike Develin, “Avoidable sets in groups”, arXiv:math/0211184 (2002).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.