A weighted generalization of Gao's n+D-1 Theorem
Abstract
Let G denotes a finite abelian group of order n and Davenport constant D, and put m= n+D-1. Let x=(x1, ..., xm)∈ Gm be a sequence with a maximal repetition attained by xm and put r=(D,). Let w=(w1, ..., wm-r)∈ m-r. Then there are an n-subset I⊂ [1,m-r] and an injection f: I [1,m], such that m∈ f(I) and Σi∈ Iwixf(i)=(Σi∈ Iwi)xm.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.