Davenport constant with weights
Pingzhi Yuan, Xiangneng Zeng

TL;DR
This paper introduces weighted Davenport constants for cyclic groups, establishing a key relationship between two such constants and solving a problem posed by multiple researchers in additive combinatorics.
Contribution
The paper defines weighted Davenport constants for cyclic groups and proves that the minimal sequence length ensuring zero-sum subsequences relates directly to the weighted Davenport constant, resolving an open problem.
Findings
Proved that $E_A(n)=D_A(n)+n-1$ for weighted Davenport constants.
Established the relationship between $E_A(n)$ and $D_A(n)$ in weighted zero-sum problems.
Solved an open problem posed by Adhikari, Rath, Chen, Thangadurai, and Griffiths.
Abstract
For the cyclic group and any non-empty . We define the Davenport constant of with weight , denoted by , to be the least natural number such that for any sequence with , there exists a non-empty subsequence and such that . Similarly, we define the constant to be the least such that for all sequences with , there exist indices , and with . In the present paper, we show that . This solve the problem raised by Adhikari and Rath \cite{ar06}, Adhikari and Chen \cite{ac08}, Thangadurai \cite{th07} and Griffiths \cite{gr08}.
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
TopicsMathematics and Applications · Functional Equations Stability Results · Advanced Optimization Algorithms Research
