A generalization of Kneser's Addition Theorem

DeVos, Matt; Goddyn, Luis; Mohar, Bojan

doi:10.1016/j.aim.2008.11.003

Cited by 36 publications

(34 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By using the main theorem of Devos et al [3] and a recently proved theorem of the authors [12], the authors [13] confirmed (2) in the cyclic case. Recently, Grynkiewicz et al [8] established (2) for an arbitrary finite abelian group.…”

Section: Introduction and Main Resultssupporting

confidence: 66%

See 1 more Smart Citation

Weighted Davenport’s constant and the weighted EGZ Theorem

Zeng

Yuan

2011

Discrete Mathematics

View full text Add to dashboard Cite

Section: Introduction and Main Resultssupporting

confidence: 66%

“…Theorem 3.1 (Devos-Goddyn-Mohar Theorem [3]). Let G be an abelian group, let A = A 1 · · · A m be a setpartition, and let…”

Section: Preliminary Resultsmentioning

confidence: 97%

Weighted Davenport’s constant and the weighted EGZ Theorem

Zeng

Yuan

2011

Discrete Mathematics

View full text Add to dashboard Cite

“…have been studied [1,[3][4][5][6]. DeVos, Goddyn and Mohar [2] further generalize the sequence a = (a 1 , a 2 , . .…”

Section: Introductionmentioning

confidence: 99%

Subsequence sums: Direct and inverse problems

Mistri

Pandey

Prakash

2015

Journal of Number Theory

View full text Add to dashboard Cite

Let A = (a 0 , . . . , a 0 r0 copies , a 1 , . . . , a 1 r1 copies , . . . , a k−1 , . . . , a k−1 rk−1 copies ) be a finite sequence of integers with k distinct terms, denoted alternatively by (a 0 , a 1 , . . . , a k−1 )r, where a 0 < a 1 < · · · < a k−1 , r = (r 0 , r 1 , . . . , r k−1 ), r i ≥ 1 for i = 0, 1, . . . , k − 1. The sum of all the terms of a subsequence of length at least one of the sequence A is said to be a subsequence sum of A. The set of all subsequence sums of A is denoted by S(r, A). The direct problem for subsequence sums is to find the lower bound for |S(r, A)| in terms of the number of distinct terms in the sequence A. The inverse problem for subsequence sums is to determine the structure of the finite sequence A of integers for which |S(r, A)| is minimal. In this paper, both the problems are solved and some well-known results for subset sum problem are obtained as corollaries of the results for subsequence sum problem. For integers a, b, c and for a set S of integers) be a finite sequence of integers, where a 0 < a 1 < · · · < a k−1 and r i ≥ 1 for i = 0, 1, . . . , k−1. Let r = (r 0 , r 1 , . . . , r k−1 ) be the ordered k-tuple. Then we denote the sequence A = (a 0 , . . . , a 0 r 0 copies , a 1 , . . . , a 1 r 1 copies , . . . , a k−1 , . . . , a k−1 0 , a 1 , . . . , a k−1 )r. In this paper, by a finite sequence of integers, we always mean a finite sequence of integers whose terms are in nondecreasing order. This does not cause any harm, because the results in this paper are related to subsequence sums which remain unaltered by changing the order of the terms of the sequence. For an integer c, let c + (a 0 , a 1 , . . . , a k−1 )r = (c + a 0 , c + a 1 , . . . , c + a k−1 )r and for a nonzero integer c, letwhere s = (r k−1 , . . . , r 0 ). For integers a, b and c such that b = a + k − 1, let [a, b]r = (a, a + 1, . . . , b)r, and c + [a, b]r = [c + a, c + b]r.We shall call [a, b]r a sequence-interval. In particular, if r = (r, r, . . . , r), then we simply write (a 0 , a 1 , . . . , a k−1 ) r in place of (a 0 , a 1 , . . . , a k−1 )r and [a, b] a + 1, . . . , −1, 1, 2, . . . , b) r .If A is a sequence, then we write a ∈ A to mean that a is a term of the sequence A. If A is a set, then the notation a ∈ A has the usual meaning. We say that two finite sequences of integers are disjoint if there is no common term in these sequences. In this case, we write A ∪ B to denote the sequence obtained by merging these sequences and reordering the terms in nondecreasing order. For example, if A = (1, 2, 4)ū, where ū = (2, 1, 3) and B = (3, 5, 6)v, where v = (1, 2, 2) are two sequences, then A ∪ B = (1, 1, 2, 4, 4, 4) ∪ (3, 5, 5, 6, 6) = (1, 2, 3, 4, 5, 6)r, where r = (2, 1, 1, 3, 2, 2). If A and B are two sets, then A ∪ B has usual meaning. Finally, we agree with the convention that a b = 0 if a and b are two positive integers such that a < b.

show abstract

“…where N = |X|, which is how the bound is stated in [34] and [8]. The form given above is often more practical and highlights the connection with Kneser's Theorem better.…”

Section: Notation and Overviewmentioning

confidence: 98%