A weighted generalization of Gao's n+D-1 Theorem

Details A weighted generalization of Gao's n+D-1 Theorem A weighted generalization of Gao's n+D-1 Theorem

2007-11-26

arxiv.org/abs/0711.4074v1

Mathematics

Combinatorics

5 pages

Scientific paper

Let $G$ denotes a finite abelian group of order $n$ and Davenport constant $D$, and put $m= n+D-1$. Let $x=(x_1, ..., x_m)\in G^m$ be a sequence with a maximal repetition $\ell$ attained by $x_m$ and put $r=\min(D,\ell)$. Let $w=(w_1, ..., w_{m-r})\in \Z^{m-r}.$ Then there are an $n$-subset $I\subset [1,m-r]$ and an injection $f: I\mapsto [1,m]$, such that $m\in f(I)$ and $$\sum_{i\in I}w_{i}x_{f({i})}=(\sum_{i\in I}w_{i})x_{m}.$$

Affiliated with

Also associated with

No associations

Rating

A weighted generalization of Gao's n+D-1 Theorem 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 A weighted generalization of Gao's n+D-1 Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A weighted generalization of Gao's n+D-1 Theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-171134