A nonlinear bound for the number of subsequence sums
From MaRDI portal
(Redirected from Publication:6201888)
Abstract: We show that a finite zero-sum-free sequence over an abelian group has at least distinct subsequence sums, unless is "controlled" by a small number of its terms; here denotes the number of terms of , and is an absolute constant.
Recommendations
Cites work
- A combinatorial problem on finite Abelian groups. I
- A combinatorial problem on finite Abelian groups. II
- Additive combinatorics
- An inverse problem about minimal zero-sum sequences over finite cyclic groups
- Behaving sequences
- Conditions for a Zero Sum Modulo n
- Generalized arithmetical progressions and sumsets
- scientific article; zbMATH DE number 3573882 (Why is no real title available?)
- scientific article; zbMATH DE number 1315265 (Why is no real title available?)
- scientific article; zbMATH DE number 1565072 (Why is no real title available?)
- scientific article; zbMATH DE number 3302356 (Why is no real title available?)
- scientific article; zbMATH DE number 3323054 (Why is no real title available?)
- scientific article; zbMATH DE number 3192146 (Why is no real title available?)
- Long zero-free sequences in finite cyclic groups.
- Non-unique factorizations. Algebraic, combinatorial and analytic theory
- On the index of minimal zero-sum sequences over finite cyclic groups
- Sums of sets of abelian group elements
- Sumsets of zerofree sequences
- Two combinatorial problems in group theory
This page was built for publication: A nonlinear bound for the number of subsequence sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201888)