Papers
Topics
Authors
Recent
Search
2000 character limit reached

On two questions about restricted sumsets in finite abelian groups

Published 19 Jul 2016 in math.NT | (1607.05718v1)

Abstract: Let $G$ be an abelian group of finite order $n$, and let $h$ be a positive integer. A subset $A$ of $G$ is called {\em weakly $h$-incomplete}, if not every element of $G$ can be written as the sum of $h$ distinct elements of $A$; in particular, if $A$ does not contain $h$ distinct elements that add to zero, then $A$ is called {\em weakly $h$-zero-sum-free}. We investigate the maximum size of weakly $h$-incomplete and weakly $h$-zero-sum-free sets in $G$, denoted by $C_h(G)$ and $Z_h(G)$, respectively. Among our results are the following: (i) If $G$ is of odd order and $(n-1)/2 \leq h \leq n-2$, then $C_h(G)=Z_h(G)=h+1$, unless $G$ is an elementary abelian 3-group and $h=n-3$; (ii) If $G$ is an elementary abelian 2-group and $n/2 \leq h \leq n-2$, then $C_h(G)=Z_h(G)=h+2$, unless $h=n-4$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.