Hostname: page-component-74656f9884-8r8nv Total loading time: 0 Render date: 2026-11-06T20:14:47.881Z Has data issue: false hasContentIssue false

Subsequence Sums

Published online by Cambridge University Press:  04 July 2003

YAHYA OULD HAMIDOUNE
Affiliation:
Université Pierre et Marie Curie, UFR 921, E. Combinatoire, 4 Place Jussieu, 75005 Paris, France (e-mail: yha@ccr.jussieu.fr)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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:

  1. $\mu$ has a value repeated $n-k+3$ times

  2. $n\wedge \mu$ contains a non-null subgroup

  3. $|n\wedge \mu|\geq m-n+k-2.$

We conjecture that the last condition could be improved to $|n\wedge \mu|\geq m-n+k-1$. This conjecture generalizes several known results. We also obtain a generalization of a recent result due to Bollobás and Leader.

Information

Type
Paper
Copyright
2003 Cambridge University Press