I have a quadratic form $Q(u) = \langle Du , u \rangle = 0$, where $D$ is circulant-symmetric from $\mathbb{R}^{n \times n}$ $D$ has all entries $0$ or $1$ except the diagonal which a negative real number $a$. It is known there are solutions to $Q(u)$ such that $u$ is just from $\{0,1\}^{n}$. I have a point $v \in \mathbb{R}^{n}$ on the quadratic form. How can I find an estimate of the distance to the closest point $w$ from $v$ such that the point $w$ satisfies $Q(w) = 0$ and has coordinates just $0$ or $1$? Are there any connections to lattice decoding? (Will simple rounding work?)
A point $v$ on what? –  Will Jagy Dec 26 '11 at 6:25
No, it really does not. The quadratic form is the function $Q.$ The null cone is the set of vectors satisfying $Q(v) = 0.$ There is no guarantee that there is any point $w$ with all coordinates $0,1$ that also lies on the null cone. Evidently $D$ is just a symmetric matrix. –  Will Jagy Dec 26 '11 at 6:38