Subsequence sums of zero-sum-free sequences
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $G$ be a finite abelian group, and let $S$ be a sequence of elements in $G$. Let $f(S)$ denote the number of elements in $G$ which can be expressed as the sum over a nonempty subsequence of $S$. In this paper, we slightly improve some results of Pixton on $f(S)$ and we show that for every zero-sum-free sequences $S$ over $G$ of length $|S|=\exp(G)+2$ satisfying $f(S)\geq 4\exp(G)-1$.
DOI : 10.37236/186
Classification : 11B75, 11B13
Mots-clés : zero-sum problems, Davenport's constant, zero-sum-free sequence
@article{10_37236_186,
     author = {Pingzhi Yuan},
     title = {Subsequence sums of zero-sum-free sequences},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/186},
     zbl = {1248.11021},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/186/}
}
TY  - JOUR
AU  - Pingzhi Yuan
TI  - Subsequence sums of zero-sum-free sequences
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/186/
DO  - 10.37236/186
ID  - 10_37236_186
ER  - 
%0 Journal Article
%A Pingzhi Yuan
%T Subsequence sums of zero-sum-free sequences
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/186/
%R 10.37236/186
%F 10_37236_186
Pingzhi Yuan. Subsequence sums of zero-sum-free sequences. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/186

Cité par Sources :