Unification of zero-sum problems, subset sums and covers of ${\mathbb Z}$

In combinatorial number theory, zero-sum problems, subset sums and covers of the integers are three different topics initiated by P. Erdös and investigated by many researchers; they play important roles in both number theory and combinatorics. In this paper we announce some deep connections among these seemingly unrelated fascinating areas, and aim at establishing a unified theory! Our main theorem unifies many results in these three realms and also has applications in many aspects such as finite fields and graph theory. To illustrate this, here we state our extension of the Erdös-Ginzburg-Ziv theorem: If $A=\{a_{s}(\mathrm{mod} n_{s})\}_{s=1}^{k}$ covers some integers exactly $2p-1$ times and others exactly $2p$ times, where $p$ is a prime, then for any $c_{1},\cdots ,c_{k}\in \mathbb{Z} /p\mathbb{Z}$ there exists an $I\subseteq \{1,\cdots ,k\}$ such that $\sum _{s\in I}1/n_{s}=p$ and $\sum _{s\in I}c_{s}=0$.