English

Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory

Number Theory 2015-05-22 v2 Information Theory Combinatorics math.IT

Abstract

We consider two families of weighted zero-sum constants for finite abelian groups. For a finite abelian group (G,+)( G , + ), a set of weights WZW \subset \mathbb{Z}, and an integral parameter mm, the mm-wise Davenport constant with weights WW is the smallest integer nn such that each sequence over GG of length nn has at least mm disjoint zero-subsums with weights WW. And, for an integral parameter dd, the dd-constrained Davenport constant with weights WW is the smallest nn such that each sequence over GG of length nn has a zero-subsum with weights WW of size at most dd. First, we establish a link between these two types of constants and several basic and general results on them. Then, for elementary pp-groups, establishing a link between our constants and the parameters of linear codes as well as the cardinality of cap sets in certain projective spaces, we obtain various explicit results on the values of these constants.

Keywords

Cite

@article{arxiv.1407.1966,
  title  = {Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory},
  author = {Luz Elimar Marchan and Oscar Ordaz and Irene Santos and Wolfgang Schmid},
  journal= {arXiv preprint arXiv:1407.1966},
  year   = {2015}
}
R2 v1 2026-06-22T04:57:50.041Z