The restricted sumsets in $\mathbb{Z}_n$
Min Tang, Meng-Ting Wei

TL;DR
This paper investigates the structure of restricted sumsets in cyclic groups, establishing conditions under which the sumset of 4 or 5 distinct elements covers the entire group, with implications for additive combinatorics.
Contribution
It provides new bounds and conditions ensuring that restricted sumsets of size 4 and 5 cover the entire cyclic group, extending previous results in additive number theory.
Findings
If || 0.4045n and n is odd, then 4^{}=n;
For even n and close to n/4, 4^{}=n;
New bounds for sumset coverage in cyclic groups.
Abstract
Let be a positive integer. For any subset , let be the set of the elements of which are sums of distinct elements of . In this paper, we obtain some new results on and . For example, we show that if and is odd, then ; Under some conditions, if is even and is close to , then .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph Labeling and Dimension Problems · graph theory and CDMA systems
