On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond
We consider the following variant of the mortality problem: given k×k matrices A1, A2, . . . , At, do there exist t nonnegative integers m1, m2, . . . , mt such that the product A1m1 A2m2· · · Atmt is equal to the zero matrix? It is known that this problem is decidable when t ≤ 2 for matrices over a...
Autores principales: | Bell, PC, Potapov, I, Semukhin, P |
---|---|
Formato: | Journal article |
Lenguaje: | English |
Publicado: |
Elsevier
2021
|
Ejemplares similares
-
On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
por: Bell, P, et al.
Publicado: (2019) -
Vector reachability problem in SL (2, ℤ)
por: Potapov, I, et al.
Publicado: (2016) -
Vector and scalar reachability problems in SL(2, Z)
por: Potapov, I, et al.
Publicado: (2018) -
Decidability of the membership problem for 2 x 2 integer matrices
por: Potapov, I, et al.
Publicado: (2017) -
Membership problem in GL(2, Z) extended by singular matrices
por: Potapov, I, et al.
Publicado: (2017)