2025/06/26 by Kevin Zhao, Zhao, Kevin
Mathematics · Engineering · #Limits and Structures in Graph Theory #Finite Group Theory Research #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2506.21383
Let G be an additive finite abelian group and let k∈ [exp(G),D(G)-1] be a positive integer. Denote by s≤ k(G) the smallest positive integer l∈ ℕ∪ \+∞\ such that each sequence of length l over G has a non-empty zero-sum subsequence of length at most k. Let kG∈ [exp(G),D(G)-1] be the smallest positive integer such that s≤ D(G)-d(G)≤ D(G)+d for D(G)-d≥ kG. We conjecture that kG=(D(G)+1)/(2) for finite abelian groups G with r(G)≥ 2 and D(G)=D^*(G). In this paper, we mainly study this conjecture for finite abelian p-groups and get some results to support this conjecture. We also prove that kG≤ D(G)-2 for all finite abelian groups G with r(G)≥ 2 except C23 and C24. In addition, we also get some lower bounds for the invariant s≤ k(G).