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...
Auteurs principaux: | Bell, PC, Potapov, I, Semukhin, P |
---|---|
Format: | Journal article |
Langue: | English |
Publié: |
Elsevier
2021
|
Documents similaires
-
On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
par: Bell, P, et autres
Publié: (2019) -
Vector reachability problem in SL (2, ℤ)
par: Potapov, I, et autres
Publié: (2016) -
Vector and scalar reachability problems in SL(2, Z)
par: Potapov, I, et autres
Publié: (2018) -
Decidability of the membership problem for 2 x 2 integer matrices
par: Potapov, I, et autres
Publié: (2017) -
Membership problem in GL(2, Z) extended by singular matrices
par: Potapov, I, et autres
Publié: (2017)