On the number of weighted subsequences with zero-sum in a finite abelian group
Ab\'ilio Lemos, Allan de Oliveira Moura

TL;DR
This paper investigates the minimum number of weighted zero-sum subsequences in finite abelian groups, establishing a lower bound and characterizing extremal sequences where equality is achieved.
Contribution
It provides a new lower bound for the count of weighted zero-sum subsequences and characterizes extremal sequences in finite abelian groups.
Findings
Established the lower bound N_{A,0}(S) ≥ 2^{|S|-D_A(G)+1}.
Characterized the structure of extremal sequences where equality holds.
Extended zero-sum theory to include weighted subsequences with specific bounds.
Abstract
Suppose is a finite abelian group and is a sequence of elements in . For any element of and , let denote the number of subsequences of such that , where and . The purpose of this paper is to investigate the lower bound for . In particular, we prove that , where is the smallest positive integer such that every sequence over of length at least has a nonempty -zero-sum subsequence. We also characterize the structures of the extremal sequences for which the equality holds for some groups.
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 · Finite Group Theory Research · graph theory and CDMA systems
