For a finite abelian group $G$ written additively, and a non-empty subset $A\subset [1,\exp(G)-1]$ the weighted Davenport Constant of $G$ with respect to the set $A$, denoted $D_A(G)$, is the least positive integer $k$ for which the following holds: Given an arbitrary sequence $(x_1,\ldots,x_k)$ with $x_i\in G$, there exists a non-empty subsequence $(x_{i_1},\ldots,x_{i_t})$ along with $a_{j}\in A$ such that $\sum_{j=1}^t a_jx_{i_j}=0$. In this paper, we pose and study a natural new extremal problem that arises from the study of $D_A(G)$: For an integer $k\ge 2$, determine $f^{(D)}_G(k):=\min\{|A|: D_A(G)\le k\}$ (if the problem posed makes sense). It turns out that for $k$ 'not-too-small', this is a well-posed problem and one of the most interesting cases occurs for $G=\mathbb{Z}_p$, the cyclic group of prime order, for which we obtain near optimal bounds for all $k$ (for sufficiently large primes $p$), and asymptotically tight (up to constants) bounds for $k=2,4$.
@article{10_37236_7996,
author = {Niranjan Balachandran and Eshita Mazumdar},
title = {The weighted {Davenport} constant of a group and a related extremal problem},
journal = {The electronic journal of combinatorics},
year = {2019},
volume = {26},
number = {4},
doi = {10.37236/7996},
zbl = {1439.11054},
url = {http://geodesic.mathdoc.fr/articles/10.37236/7996/}
}
TY - JOUR
AU - Niranjan Balachandran
AU - Eshita Mazumdar
TI - The weighted Davenport constant of a group and a related extremal problem
JO - The electronic journal of combinatorics
PY - 2019
VL - 26
IS - 4
UR - http://geodesic.mathdoc.fr/articles/10.37236/7996/
DO - 10.37236/7996
ID - 10_37236_7996
ER -
%0 Journal Article
%A Niranjan Balachandran
%A Eshita Mazumdar
%T The weighted Davenport constant of a group and a related extremal problem
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/7996/
%R 10.37236/7996
%F 10_37236_7996
Niranjan Balachandran; Eshita Mazumdar. The weighted Davenport constant of a group and a related extremal problem. The electronic journal of combinatorics, Tome 26 (2019) no. 4. doi: 10.37236/7996