Take an infinite finitely generated group $G$ with an infinite subgroup $N$ which has an infinite centraliser $Z = Z_G(N)$. Let $S$ be some [symmetric] generating set of $G$ and for $g \in G$, denote by $\mathrm{norm}(g)$ the combinatorial distance between $g$ and the identity in the Cayley graph w.r.t. $S$. Then $A= \mathrm{norm}(N)$ and $B=\mathrm{norm}(Z)$ are some subsets of the ($\geq 0$) integers.
Question: is it possible that $A$ and $B$ are asymptotically separated by large gaps, that is for every $C>1$ there is a $n_0$ such that
$\forall a \in A \cap [n_0,\infty[$, $B \cap [a/C,aC] = \emptyset$
$\forall b \in B \cap [n_0,\infty[$, $A \cap [b/C,bC] = \emptyset$
Note that if either $Z$ or $N$ contain an element $x$ of infinite order, then the answer is no (since $\mathrm{norm}(x^n) \to \infty$ and the triangle inequality implies $\mathrm{norm}(x^n) - \mathrm{norm}(x^{n-1}) \leq \mathrm{norm}(x)$, so the largest gap has length $< \mathrm{norm}(x)$).
This question is partially motivated by the fact that it is possible for the centre of an [infinite finitely generated] group $C = Z_G(G)$ to be so that $\mathrm{norm}(C)$ [is infinite] and has large gaps (in the sense that forall $C>1$ there is a $n > 2$ such that $\mathrm{norm}(C) \cap ]n/C,Cn[ = \emptyset$)