As a humble member of the pre-trash subset of this site's users, I just wanted to step in and quickly ask, whenever I'm working with bilinear forms, I'm always going to be working with transposes and not inverse matrices when I'm diagonalizing, right?
The idea is that you can compute $h_{V(F)}(l)$ for $l > d$, then $k[x_0,\ldots,x_n]_{(l)}$ has dimension $\binom{n+l}{n}$, and then $(F)_{(l)}$ is just $F$ homogeneous polynomials of degree $l-d$, so that has dimension $\binom{n+l-d}{n}$
So $h_{V(F)}(l) = \binom{l+n}{n} - \binom{n+l-d}{n} = \frac{1}{n!}(l+1)\ldots (l+n) - \frac{1}{n!}(l-d+1) \ldots (l-d+n)$, so this polynomial has degree $n-1$, so that's the dimension of $V(F)$
I think the increasing sequence $\{q_i^-\}$ will diverge, since the sequence of open neighbourhoods will shrink towards $q_- \to "-\infty_+"$ which is not in the set, thus that sequence diverges
But otherwise, every point should be accessible from some net in $\Bbb{Q}^+ \cup \Bbb{Q}^-$ so it should be dense in $2\cdot \Bbb{R}$ and also $\Bbb{R}$