English

Arithmetic-Progression-Weighted Subsequence Sums

Number Theory 2011-06-29 v2

Abstract

Let GG be an abelian group, let SS be a sequence of terms s1,s2,...,snGs_1,s_2,...,s_{n}\in G not all contained in a coset of a proper subgroup of GG, and let WW be a sequence of nn consecutive integers. Let WS={w1s1+...+wnsn:  wiatermofW,wiwjforij},W\odot S=\{w_1s_1+...+w_ns_n:\;w_i {a term of} W,\, w_i\neq w_j{for} i\neq j\}, which is a particular kind of weighted restricted sumset. We show that WSmin{G1,n}|W\odot S|\geq \min\{|G|-1,\,n\}, that WS=GW\odot S=G if nG+1n\geq |G|+1, and also characterize all sequences SS of length G|G| with WSGW\odot S\neq G. This result then allows us to characterize when a linear equation a1x1+...+arxrαmodn,a_1x_1+...+a_rx_r\equiv \alpha\mod n, where α,a1,...,arZ\alpha,a_1,..., a_r\in \Z are given, has a solution (x1,...,xr)Zr(x_1,...,x_r)\in \Z^r modulo nn with all xix_i distinct modulo nn. As a second simple corollary, we also show that there are maximal length minimal zero-sum sequences over a rank 2 finite abelian group GCn1Cn2G\cong C_{n_1}\oplus C_{n_2} (where n1n2n_1\mid n_2 and n23n_2\geq 3) having kk distinct terms, for any k[3,min{n1+1,exp(G)}]k\in [3,\min\{n_1+1,\,\exp(G)\}]. Indeed, apart from a few simple restrictions, any pattern of multiplicities is realizable for such a maximal length minimal zero-sum sequence.

Keywords

Cite

@article{arxiv.1102.5351,
  title  = {Arithmetic-Progression-Weighted Subsequence Sums},
  author = {David J. Grynkiewicz and Andreas Philipp and Vadim Ponomarenko},
  journal= {arXiv preprint arXiv:1102.5351},
  year   = {2011}
}
R2 v1 2026-06-21T17:32:13.400Z