I'm considering a $d \times d$ square matrix $A$ over $\mathbb{R}$, and a given vector $v \in \mathbb{R}^d$, and I'm wondering when the matrix $$\Sigma = [A^0v \quad A^1 v \quad A^2v\quad\ldots\quad A^{d-1}v]$$ has full rank (with $A^0$ being the identity matrix $I_d$).
The vector $v$ is considered given, so (I think) this is not just a question of whether a such $v$ exists, which I've seen discussed a few places. (e.g. here).
As this answer explains, if $A$ is diagonalizable, this is equivalent to $A$ having $d$ distinct eigenvalues and that $v$ cannot be written as a linear combination of $m < d$ of the eigenvalues of $A$.
But in the case that $A$ is not diagonalizable, I cannot come up with a similar criterion. Inspired by the diagonalizable case, one could think that again distinct eigenvalues would be the key. But if $$ A = \begin{pmatrix} 2 & 0 & 0 \\ 0 & 1 & 1 \\ 0 & 0 & 1 \end{pmatrix}, \qquad v = \begin{pmatrix}1 \\ 1 \\ 1\end{pmatrix}, $$ $A$ has eigenvalues $1, 1$ and $2$, but $[v \quad Av\quad A^2v] = \begin{pmatrix}1 & 2 & 4 \\ 1 & 2 & 3 \\ 1 & 1 & 1\end{pmatrix}$ has full rank still.
(Observe that if one removes the off-diagonal in $A$, it becomes diagonalizable and so by the non-unique eigenvalues, it doesn't have full rank).
Can anyone phrase conditions on $A$ and $v$ to determine whether the cyclic subspace has full rank?