Growth of bilinear maps III: Decidability
arXiv:2201.09850 · doi:10.1016/j.tcs.2025.115515
Abstract
The following notion of growth rate can be seen as a generalization of joint spectral radius: Given a bilinear map with nonnegative coefficients and a nonnegative vector , denote by the largest possible entry of a vector obtained by combining instances of using applications of . Let denote the growth rate . Rosenfeld showed that the problem of checking is undecidable by reducing the problem of joint spectral radius. In this article, we provide a simpler reduction using the observation that matrix multiplication is actually a bilinear map. Moreover, we extend the reduction to show that checking is still undecidable even if is positive. If there is no restriction on the signs, we can also show that the problem of checking if the system can produce a zero vector is undecidable by reducing the problem of checking the mortality of a pair of matrices. This answers a question asked by Rosenfeld. Beside that, we confirm a remark of Rosenfeld that the problem does not become harder when we introduce more bilinear maps and more starting vectors. It is known that if the vector is strictly positive, then the limit superior is actually a limit. However, we show that when is only nonnegative, the problem of checking the existence of the limit is undecidable. This also answers a question asked by Rosenfeld. We provide a formula for the growth rate in terms of the diagonals of matrices corresponding to a special structure called ``linear pattern''. A condition is given so that the limit exists. This actually provides a simpler proof for the existence of the limit when . An important corollary of the formula is the computability of the growth rate,....
17 pages; proves undecidability of the positive setting unconditionally, minor corrections before publication