Sum-avoiding sets in groups
Sum-avoiding sets in groups, Discrete Analysis 2016:15, 27 pp. Let $A$ be a subset of an Abelian group $G$. A subset $B\subset A$ is called _sum-avoiding in $A$_ if no two elements of $B$ add up to an element of $A$. Write $\phi(A)$ for the size of the largest sum-avoiding subset of $A$. If $G=\mat...
Main Authors: | Terence Tao, Van Vu |
---|---|
Format: | Article |
Language: | English |
Published: |
Diamond Open Access Journals
|
Series: | Discrete Analysis |
Online Access: | http://discrete-analysis.scholasticahq.com/article/887-sum-avoiding-sets-in-groups.pdf |
Similar Items
-
Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs
by: Kubicka Ewa, et al.
Published: (2015-08-01) -
On sums of sets of integers /
by: Lin, Chio-Shih
Published: (1955) -
Sum of squares generalizations for conic sets
by: Kapelevich, Lea, et al.
Published: (2022) -
On direct sums of cyclic groups
by: Yi-Jing Shiu, et al.
Published: (1999) -
Nonadaptive search problem with sets of equal sum
by: Kolev Emil
Published: (2003-09-01)