# A generalization of Kneser's Addition Theorem

```@article{DeVos2009AGO,
title={A generalization of Kneser's Addition Theorem},
author={Matt DeVos and Luis A. Goddyn and Bojan Mohar},
year={2009},
volume={220},
pages={1531-1548}
}```
• Published 20 March 2009
• Mathematics
• Advances in Mathematics

### On n-Sums in an Abelian Group

• Mathematics
Combinatorics, Probability and Computing
• 2015
It is proved that either ng ∈ Σ n (S) for every term g in S whose multiplicity is at least \${\mathsf h}\$ (S), ⩾ min{n + 1, |S| − n + | supp (S)| − 1}, where |supp(S)| denotes the number of distinct terms that occur in S.

### Character and Linear Algebraic Methods: Snevily’s Conjecture

In this chapter, we present another (and very recent) application of the method of Character Sums. Let G be a finite abelian group and let A, B⊆G be subsets of equal cardinality (say) k. Then we

### Weighted subsequence sums in finite Abelian Groups

A well-known result of Erdős-Ginzburg-Ziv  says that, given a sequence S of 2n− 1 integers, there is a subsequence S ′ of S with length n such that the sum of the terms of S ′ is zero modulo n.

### A weighted generalization of two theorems of Gao

• Mathematics
• 2009
AbstractLet G be a finite abelian group and let A⊆ℤ be nonempty. Let DA(G) denote the minimal integer such that any sequence over G of length DA(G) must contain a nontrivial subsequence s1⋯sr such

### Number of Weighted Subsequence Sums with Weights in {1, –1}

• Mathematics
Integers
• 2011
A lower bound on the number of A-weighted n-sums of the sequence S is obtained on the existence of zero-smooth subsequences and the DeVos–Goddyn–Mohar Theorem is obtained.

### Matchings in matroids over abelian groups

• Mathematics
• 2022
We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group (G,+) is a bijection f : A → B between two finite subsets A,B of G satisfying a +

### Two conjectures on an addition theorem

• Mathematics
• 2011
Theorem 1.1 (EGZ Theorem). Let G denote a cyclic group of order n and S ∈ F(G) be a sequence of length 2n− 1 over G. Then 0 ∈ ∑ n(S). The length 2n− 1 is sharp in view of the example S = 0n−1gn−1,

### On a conjecture of Zhuang and Gao

• Mathematics
Colloquium Mathematicum
• 2022
Let G be a multiplicatively written finite group. We denote by E(G) the smallest integer t such that every sequence of t elements in G contains a product-one subsequence of length |G|. In 1961,