Inverse restricted sumset conjecture at the prime threshold
Inverse restricted sumset conjecture at the prime threshold
Let be an abelian group, let be the smallest prime divisor of the order of , and let be an -subset of . Assume that and are positive integers satisfying . Inverse restricted sumset conjecture. The restricted -fold sumset has size if and only if is contained in a coset of a subgroup with . This is the second inverse problem paralleling the known unrestricted results and remains open.
Sources & referencesView supporting material
Primary source
Bela Bajnok, “A Walk Through Some Newer Parts of Additive Combinatorics”, arXiv:2211.01893 (2022).
Additional references
2 papers in this index state this conjecture (2015–2022). The statement above is taken from the most recent of them; the others are arXiv:1512.03038.
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.