A multiplicative property for zero-sums. II
The electronic journal of combinatorics, Tome 29 (2022) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

For $n\geq 1$, let $C_n$ denote a cyclic group of order $n$. Let $G=C_n\oplus C_{mn}$ with $n\geq 2$ and $m\geq 1$, and let $k\in [0,n-1]$. It is known that any sequence of $mn+n-1+k$ terms from $G$ must contain a nontrivial zero-sum of length at most $mn+n-1-k$. The associated inverse question is to characterize those sequences with maximal length $mn+n-2+k$ that fail to contain a nontrivial zero-sum subsequence of length at most $mn+n-1-k$. For $k\leq 1$, this is the inverse question for the Davenport Constant. For $k=n-1$, this is the inverse question for the $\eta(G)$ invariant concerning short zero-sum subsequences. For $C_n\oplus C_n$ and $k\in [2,n-2]$, with $n\geq 5$ prime, it was conjectured in a paper of Grynkiewicz, Wang and Zhao that they must have the form $S=e_1^{[n-1]}\boldsymbol{\cdot} e_2^{[n-1]}\boldsymbol{\cdot} (e_1+e_2)^{[k]}$ for some basis $(e_1,e_2)$, with the conjecture established in many cases and later extended to composite moduli $n$. In this paper, we focus on the case $m\geq 2$. Assuming the conjectured structure holds for $k\in [2,n-2]$ in $C_n\oplus C_n$, we characterize the structure of all sequences of maximal length $mn+n-2+k$ in $C_n\oplus C_{mn}$ that fail to contain a nontrivial zero-sum of length at most $mn+n-1-k$, showing they must either have the form $S=e_1^{[n-1]}\boldsymbol{\cdot} e_2^{[sn-1]}\boldsymbol{\cdot} (e_1+e_2)^{[(m-s)n+k]}$ for some $s\in [1,m]$ and basis $(e_1,e_2)$ with $\mathsf{ord}(e_2)=mn$, or else have the form $S=g_1^{[n-1]}\boldsymbol{\cdot} g_2^{[n-1]}\boldsymbol{\cdot} (g_1+g_2)^{[(m-1)n+k]}$ for some generating set $\{g_1,g_2\}$ with $\mathsf{ord}(g_1+g_2)=mn$. In view of prior work, this reduces the structural characterization for a general rank two abelian group to the case $C_p\oplus C_p$ with $p$ prime. Additionally, we give a new proof of the precise structure in the case $k=n-1$ for $m=1$. Combined with known results, our results unconditionally establish the structure of extremal sequences in $G=C_n\oplus C_{mn}$ in many cases, including when $n$ is only divisible by primes at most $7$, when $n\geq 2$ is a prime power and $k\leq \frac{2n+1}{3}$, or when $n$ is composite and $k=n-d-1$ or $n-2d+1$ for a proper, nontrivial divisor $d\mid n$.
DOI : 10.37236/10921
Classification : 11B13, 11B75, 11B30, 11P70, 05B10
Mots-clés : zero-sum, Davenport constant, short zero-sum, sequence subsum

David J. Grynkiewicz  1   ; Chao Liu  1

1 University of Memphis
@article{10_37236_10921,
     author = {David J. Grynkiewicz and Chao Liu},
     title = {A multiplicative property for zero-sums. {II}},
     journal = {The electronic journal of combinatorics},
     year = {2022},
     volume = {29},
     number = {3},
     doi = {10.37236/10921},
     zbl = {1502.11018},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/10921/}
}
TY  - JOUR
AU  - David J. Grynkiewicz
AU  - Chao Liu
TI  - A multiplicative property for zero-sums. II
JO  - The electronic journal of combinatorics
PY  - 2022
VL  - 29
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/10921/
DO  - 10.37236/10921
ID  - 10_37236_10921
ER  - 
%0 Journal Article
%A David J. Grynkiewicz
%A Chao Liu
%T A multiplicative property for zero-sums. II
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/10921/
%R 10.37236/10921
%F 10_37236_10921
David J. Grynkiewicz; Chao Liu. A multiplicative property for zero-sums. II. The electronic journal of combinatorics, Tome 29 (2022) no. 3. doi: 10.37236/10921

Cité par Sources :