Conjectural formula for unrestricted-length restricted sumsets in cyclic groups
Conjectural formula for unrestricted-length restricted sumsets in cyclic groups
Let be a positive integer and let . For an -subset of , write for its restricted sumset over all numbers of terms, and let be the minimum possible size of . Let be the divisor-based function defined from the constructions . Unrestricted-length restricted-sumset formula conjecture. For all positive integers and ,
The construction gives the upper bound, and numerical experimentation in the source supports equality; a proof is not supplied.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Béla Bajnok, “Open problems about sumsets in finite abelian groups: minimum sizes and critical numbers”, arXiv:1512.03038 (2017).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.