Unextendible sequences in finite abelian groups
The electronic journal of combinatorics, Tome 15 (2008)
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl EuDML
Let $G=C_{n_1}\oplus \ldots \oplus C_{n_r}$ be a finite abelian group with $r=1$ or $1 < n_1|\ldots|n_r$, and let $S=(a_1,\ldots,a_t)$ be a sequence of elements in $G$. We say $S$ is an unextendible sequence if $S$ is a zero-sum free sequence and for any element $g\in G$, the sequence $Sg$ is not zero-sum free any longer. Let $L(G)=\lceil \log_2{n_1}\rceil+\ldots+\lceil \log_2{n_r}\rceil$ and $d^*(G)=\sum_{i=1}^r(n_i-1)$, in this paper we prove, among other results, that the minimal length of an unextendible sequence in $G$ is not bigger than $L(G)$, and for any integer $k$, where $L(G)\leq k \leq d^*(G)$, there exists at least one unextendible sequence of length $k$.
Jujuan Zhuang. Unextendible sequences in finite abelian groups. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/899
@article{10_37236_899,
author = {Jujuan Zhuang},
title = {Unextendible sequences in finite abelian groups},
journal = {The electronic journal of combinatorics},
year = {2008},
volume = {15},
doi = {10.37236/899},
zbl = {1206.11034},
url = {http://geodesic.mathdoc.fr/articles/10.37236/899/}
}
Cité par Sources :