Back to Search
Start Over
On matrix powering in low dimensions
- Publication Year :
- 2017
- Publisher :
- Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
-
Abstract
- We investigate the Matrix Powering Positivity Problem, PosMatPow: given an m X m square integer matrix M, a linear function f: Z^{m X m} -> Z with integer coefficients, and a positive integer n (encoded in binary), determine whether f(M^n) \geq 0. We show that for fixed dimensions m of 2 and 3, this problem is decidable in polynomial time.
- Subjects :
- 000 Computer science, knowledge, general works
Computer Science
Subjects
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....8973c3dade9d016551e880811ab9dcbb