I recently asked in this thread about lower bounds on the complexity in the case where we have an aperiodic subshift. If I denote $c_n(\Omega)$ as the number of possible patterns on $Q_n= \big\{ 0,...,n-1 \big \}^d$, Ville Salo mentioned a paper\slides by Julien Cassaigne showing contrary to what I thought. Namely, that for $d\geq 3$ and any $f:\mathbb{N}\to \infty$ satisfying $\lim f(n)=\infty$, we have some aperiodic subshift $\Omega_f\subseteq \mathcal{A}^{\mathbb{Z}^d}$, such that
$$ c_n(\Omega_f)=O(n^2 f). $$
I was hoping that $\liminf \frac{c_n(\Omega)}{n^d}\geq C_d$. My subsequent question is whether we can say for $d\geq 3$, that for an aperiodic subshift, $\Omega\subseteq \mathcal{A}^{\mathbb{Z}^d}$, we have
$$ \liminf \frac{c_n(\Omega)}{n^2}\geq C_d \quad \text{or even} \quad \liminf \frac{c_n(\Omega)}{n}\geq C_d .$$
It seems to me that this should be true if we take an aperiodic configuration $\omega \in \mathcal{A}^{\mathbb{Z}^d}$ and project them to a $2$-dimensional or $1$-dimensional subspaces by the standard basis this should work. i.e., one of these projected configurations would have to be aperiodic and we can use the results in the $2$/$1$-dimensional cases.
Since I am not well versed in the subject of complexity estimations and my intuition has already been wrong, I thought that there may be a fault in this logic or a known counter-example. I would appreciate any comments on whether this question should have an obvious answer.