Arithmetic-Progression-Weighted Subsequence Sums

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Let $G$ be an abelian group, let $S$ be a sequence of terms $s_1,s_2,...,s_{n}\in G$ not all contained in a coset of a proper subgroup of $G$, and let $W$ be a sequence of $n$ consecutive integers. Let $$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 $|W\odot S|\geq \min\{|G|-1,\,n\}$, that $W\odot S=G$ if $n\geq |G|+1$, and also characterize all sequences $S$ of length $|G|$ with $W\odot S\neq G$. This result then allows us to characterize when a linear equation $$a_1x_1+...+a_rx_r\equiv \alpha\mod n,$$ where $\alpha,a_1,..., a_r\in \Z$ are given, has a solution $(x_1,...,x_r)\in \Z^r$ modulo $n$ with all $x_i$ distinct modulo $n$. As a second simple corollary, we also show that there are maximal length minimal zero-sum sequences over a rank 2 finite abelian group $G\cong C_{n_1}\oplus C_{n_2}$ (where $n_1\mid n_2$ and $n_2\geq 3$) having $k$ distinct terms, for any $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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Arithmetic-Progression-Weighted Subsequence Sums does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Arithmetic-Progression-Weighted Subsequence Sums, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arithmetic-Progression-Weighted Subsequence Sums will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-301964

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.