On weighted zero-sum sequences
Sukumar Das Adhikari, David J. Grynkiewicz, and Zhi-Wei Sun

TL;DR
This paper investigates the minimal sequence length in finite abelian groups ensuring zero-sum subsequences with weights from a subset A, providing bounds, asymptotic behavior, and exact values for specific cases.
Contribution
It introduces new bounds and asymptotic formulas for weighted zero-sum sequences in finite abelian groups, especially for A={1,-1}, using L-intersecting set systems.
Findings
Bound s_A(G) in terms of Davenport constant and |A| for p-groups.
Asymptotic formula for s_{1,-1}(G) when exp(G) is even.
Exact or near-exact values for s_{1,-1}(G) in certain groups.
Abstract
Let G be a finite additive abelian group with exponent exp(G)=n>1 and let A be a nonempty subset of {1,...,n-1}. In this paper, we investigate the smallest positive integer , denoted by s_A(G), such that any sequence {c_i}_{i=1}^m with terms from G has a length n=exp(G) subsequence {c_{i_j}}_{j=1}^n for which there are a_1,...,a_n in A such that sum_{j=1}^na_ic_{i_j}=0. When G is a p-group, A contains no multiples of p and any two distinct elements of A are incongruent mod p, we show that s_A(G) is at most if |A| is at least (D(G)-1)/(exp(G)-1), where D(G) is the Davenport constant of G and this upper bound for s_A(G)in terms of |A| is essentially best possible. In the case A={1,-1}, we determine the asymptotic behavior of s_{{1,-1}}(G) when exp(G) is even, showing that, for finite abelian groups of even exponent and fixed rank,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · graph theory and CDMA systems · Finite Group Theory Research
