Abstract:
Discrete systems $x(k + 1) = Ax(k) + Bx(k − m)$, $k = 0, 1,\ldots$ are analyzed, where $m$ is a fixed positive integer,
$A, B$ are constant 3 by 3 matrices and $x : {−m, −m + 1, \ldots} \rightarrow 3$. Assuming that the system is weakly delayed,
its general solution is constructed for every case of the Jordan form of the matrix $A$.
It is shown that, for $k \ge 3m$ or for $k \ge 2m$, these formulas reduce to simple forms depending on only the three independent parameters
generated by the initial values. Formulas connecting these parameters with the initial ones are found.
The results are illustrated by examples. Open problems for future research are discussed, and comparisons are given with the previous results.