Let $x_1,x_2,\ldots, x_k \in [0,1]$ be irrational numbers.
I'm interested in what, if anything, can be said about the values $\{nx_i \bmod 1: n\in \mathbb{N}\}$. Specifically, I'm interested if there are constraints that we can place on the $x_i$'s such that for any set of $y_i$'s and any $\varepsilon \in (0,1/2)$, there exists $n\in \mathbb{N}$ simultaneously satisfying
$$nx_i- y_i \bmod 1 \equiv \varepsilon_i$$ for all $i\in \{1,2,\ldots, k\}$, where all $\varepsilon_i \in (-\varepsilon, \varepsilon)$.
I know that this is impossible in general. For example, if $x_1=\sqrt{2},x_2=2\sqrt{2}$ then we could not have $x_1 n\bmod 1\approx 1/3$ and $x_2 n \bmod 1 \approx 1/3$ simultaneously. However, I maybe if we place some restrictions on $x_i$, e.g., requiring them all to be pairwise linearly independent over $\mathbb{Q}$, then we could say something of this form?