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, does there exist nonnegative integers m1, m2, . . ., mt such that the product Am11 Am22 · · · Amtt is equal to the zero matrix? It is known that this problem is decidable when t ≤ 2 for matrices over...
Päätekijät: | Bell, P, Potapov, I, Semukhin, P |
---|---|
Aineistotyyppi: | Conference item |
Julkaistu: |
Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
2019
|
Samankaltaisia teoksia
-
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond
Tekijä: Bell, PC, et al.
Julkaistu: (2021) -
Vector reachability problem in SL (2, ℤ)
Tekijä: Potapov, I, et al.
Julkaistu: (2016) -
Vector and scalar reachability problems in SL(2, Z)
Tekijä: Potapov, I, et al.
Julkaistu: (2018) -
Decidability of the membership problem for 2 x 2 integer matrices
Tekijä: Potapov, I, et al.
Julkaistu: (2017) -
Membership problem in GL(2, Z) extended by singular matrices
Tekijä: Potapov, I, et al.
Julkaistu: (2017)