Let $V$ be a finite dimensional vector space over a finite field $\mathbb{F}\_q$ (the most interesting case to me is $q=O(1)$). Let $A$ be an arbitrary subset of $V$ that spans $V$ over $\mathbb{F}\_q$. Let $\mu=|A|/|V|$ be the density of $A$. What can we say about the smallest $k$ such that every $v\in V$ can be written as a linear combination of $t\leq k$ elements $a\_1,\dots, a\_t\in A$
$$
v=\sum\_{i=1}^t c\_i a\_i
$$
with coefficients $c\_i\in\mathbb{F}\_q$?


I can prove $k\leq (1/\mu)^c$ for some constant $c>0$, basically by repeating applying the fact that $|A-A|\geq (3/2)|A|$ if $A$ is not a subgroup of $V$. This fact follows from an argument of Laba, and is stated as Lemma 2.5 in the following survey by Lovett:
<http://cseweb.ucsd.edu/~slovett/files/addcomb-survey.pdf>


Is there a better upper bound? And any lower bounds known?



Smallest $k$ such that every vector is a linear combination of at most $k$ generators
A related problem was studied in the papers by Ben Klopsch and myself [How long does it take to generate a group?](https://arxiv.org/abs/0911.2908) and [Generating abelian groups by addition only](https://arxiv.org/abs/0911.2966). Describing precisely the connections with your question within the framework of an MO post would be tricky, but, for instance, Theorem 2.9 from the latter paper implies readily that every vector from $V$ can be written as $a\_1+\dotsb+a\_k$ with $k\le(2/\mu)-1$ and $a\_1,\dotsc,a\_k\in A$, with some easily classified exceptions.


And, BTW, the estimate $|A-A|\ge(3/2)|A|$ goes back to the early 50th of the previous century; it can be found in the papers of Freiman, Kneser, Kemperman, Mann, Olson, Scherk, ...


