Hildebrand's consecutive stable-set intersection conjecture
Statement
Let be a stable set, meaning that for every natural number , the set of for which membership of and in differs has density . Write for the lower density of .
Hildebrand's conjecture. If has positive lower density, then for every natural number ,
This conjecture generalizes the known two-set result that stable sets of positive lower density contain many consecutive pairs. The paper provides a counterexample, so the conjecture is refuted.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.