Processing math: 100%

Weighted zero-sum problems over Cr3

Hemar Godinho, Abílio Lemos, Diego Marques

Abstract


Let Cn be the cyclic group of order n and set sA(Crn) as the smallest integer such that every sequence S in Crn of length at least has an A-zero-sum subsequence of length equal to exp(Crn), for A={1,1}. In this paper, among other things, we give estimates for sA(Cr3),  and  prove that sA(C33)=9, sA(C43)=21 and 41sA(C53)45.


Keywords


Weighted zero-sum, abelian groups

Full Text:

PDF

Refbacks

  • There are currently no refbacks.