![](/files/happy5.png)
The additive basis conjecture
Conjecture For every prime
, there is a constant
(possibly
) so that the union (as multisets) of any
bases of the vector space
contains an additive basis.
![$ p $](/files/tex/928cd9d544fdea62f88a627aaee28c416c4366c0.png)
![$ c(p) $](/files/tex/996da72e7b0b6591ec8cc40dcbe46964d764e211.png)
![$ c(p)=p $](/files/tex/b1a6c0fbe5cae8582d2ef00c5f0f5158c9d9d4be.png)
![$ c(p) $](/files/tex/996da72e7b0b6591ec8cc40dcbe46964d764e211.png)
![$ ({\mathbb Z}_p)^n $](/files/tex/ea205f9e138abfc9a2c6a35332ecc6694ebe6419.png)
Definition: Let be a finite dimensional vector space over the field
. We call a multiset
with elements in
an additive basis if for every
, there is a subset of
which sums to
.
It is worth noting that this conjecture would also imply that every -edge-connected graph has a nowhere-zero 3-flow, thus resolving The weak 3-flow conjecture.