Subsequence Sums
Published in Combinatorics Probability Computing • Jul 1, 2003
Authors:
Yahya Ould Hamidoune
Abstract
Let $G$ be a cyclic group of order $n$ and let $\mu = \{x_1,x_2, \dots, x_m\}$ be a sequence of elements of $G$. Let $k$ be the number of distinct values taken by the sequence $\mu$. Let $n\wedge \mu$ be the set of the $n$-subsequence sums.We show that one of the following conditions holds:$\mu$ has...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!