On two questions about restricted sumsets in finite abelian groups
B\'ela Bajnok, Samuel Edwards

TL;DR
This paper studies the maximum sizes of special subsets in finite abelian groups that are incomplete or zero-sum-free with respect to sums of a fixed number of elements, providing exact values for certain group types and parameters.
Contribution
It determines the maximum sizes of weakly h-incomplete and weakly h-zero-sum-free sets in finite abelian groups for specific cases, extending understanding of sumset restrictions.
Findings
For odd order groups with certain h, the maximum size is h+1.
For elementary abelian 2-groups with certain h, the maximum size is h+2.
Exact values are given except for specific small cases.
Abstract
Let be an abelian group of finite order , and let be a positive integer. A subset of is called {\em weakly -incomplete}, if not every element of can be written as the sum of distinct elements of ; in particular, if does not contain distinct elements that add to zero, then is called {\em weakly -zero-sum-free}. We investigate the maximum size of weakly -incomplete and weakly -zero-sum-free sets in , denoted by and , respectively. Among our results are the following: (i) If is of odd order and , then , unless is an elementary abelian 3-group and ; (ii) If is an elementary abelian 2-group and , then , unless .
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 · Advanced Topology and Set Theory · Computability, Logic, AI Algorithms
