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

dc.creatorHamidoune, Yahya O.
dc.date2007-11-26
dc.date.accessioned2026-07-07T08:45:03Z
dc.date.available2026-07-07T08:45:03Z
dc.descriptionLet $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}.$$
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/0711.4074
dc.identifierhttp://arxiv.org/abs/0711.4074
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142862
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.subject11B50, 20D60
dc.titleA weighted generalization of Gao's n+D-1 Theorem
dc.typetext

Files

Collections