I am studying mathematics of lattices and I came up with a question but I am still unable to answer it.
Given a integer lattice $\mathcal{L}(B) = \sum_{i=1}^nx_ib_i:x_i \in \mathbb{Z}$, and a point $t$ that lies in the space spun by the lattice, is it possible, in polynomial time, to check whether $t$ lies inside the fundamental parallelepiped generated by the lattice?
Any vector $v\in\mathrm{span}(b_1,\ldots, b_n)$ is expressible as a unique linear combination of these basis vectors, so there exists unique $x\in\mathbb{R}^n$ such that $Bx=v$, that is solvable in polynomial time, by say Gaussian elimination or matrix inversion, $x=B^{-1}v$. Now we just have to check whether $0\le x_i<1$ for all $i=1,\ldots, n$, to know if $v$ is in the fundamental parallelepiped.