Erdős Problem #862 — Number of Maximal Sidon Sets
For a positive integer , write . A subset is Sidon if equality of two sums of pairs of its elements forces the pairs to be equal, with pairs understood as unordered and repetitions allowed. It is inclusion-maximal if no strictly larger Sidon subset of contains it; this does not require it to have maximum cardinality. Let be the number of such inclusion-maximal subsets. Is it true that
that is, that ? Erdős Problems #862
Background
The question sits alongside the classical enumeration problem of Cameron and Erdős: how many Sidon subsets does an interval contain? This is distinct from counting inclusion-maximal ones. The distinction matters because every Sidon set can be extended to a maximal one, while a maximal set can contain many Sidon subsets. Cameron and Erdős also considered maximal members of other families of integer sets. Kohayakawa, Lee, Rödl and Samotij, The Number of Sidon Sets Cameron and Erdős, Notes on sum-free and related sets
The relevant scale comes from the extremal size of a Sidon subset of an interval: if denotes the largest possible size, then . Thus a single maximal Sidon set has at most subsets. Enumeration of all Sidon sets on the exponential-in- scale can therefore yield information about how many maximal sets there are. Kohayakawa, Lee, Rödl and Samotij, The Number of Sidon Sets Saxton and Thomason, Hypergraph containers
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
No solutions have been posted yet.