Bollobas, Bela


Few subsequence sums in Z_n x Z_n ★★

Author(s): Bollobas; Leader

\begin{conjecture} For every $0 \le t \le n-1$, the sequence in ${\mathbb Z}_n^2$ consisting of $n-1$ copes of $(1,0)$ and $t$ copies of $(0,1)$ has the fewest number of distinct subsequence sums over all zero-free sequences from ${\mathbb Z}_n^2$ of length $n-1+t$. \end{conjecture}

Keywords: subsequence sum; zero sum

Syndicate content