I am looking for a certain notion of sparseness of lattices.
I want to find a vector in $\mathbb{Z}^N$ that the minimal possible inner product with all the vectors of a given lattice. Or at least, I would like to know what this number is.
In other words, for a positive-definite lattice $\Gamma$ or rank $N$, what is $$ \min_{\vec{v} \in \mathbb{Z}^N} \max_{\vec{u} \in \Gamma} \frac{\vec{u} \cdot \vec{v}}{u v} $$
If $\Gamma$ is a hypercubic lattice, then I can always choose $\vec{u}$ to be $\vec{v}$, which means this quantity is just 1. Can I choose $\Gamma$ such that it is provably less than 1?
What is the value of this quantity for the smallest unimodular even lattice ($E_8$)?
I would expect that unimodular lattices with no roots (vectors of norm 1 or 2) are sparse in the above sense; the intuition being that they miss many of the short vectors in $\mathbb{Z}^N$.
Edit: normalization