Membership testing in commutative tranformation semigroups
Information and Computation
When is a pair of matrices mortal?
Information Processing Letters
Example of undecidable problems for 2-generator matrix semigroups
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Multiplicative equations over commuting matrices
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved matrix pair undecidability results
Acta Informatica
Membership Problem for the Modular Group
SIAM Journal on Computing
On undecidability bounds for matrix decision problems
Theoretical Computer Science
Efficient average-case algorithms for the modular group
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Reachability problems in quaternion matrix and rotation semigroups
Information and Computation
Post Correspondence Problem and Small Dimensional Matrices
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
On the problem of freeness of multiplicative matrix semigroups
Theoretical Computer Science
Periodic and infinite traces in matrix semigroups
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Mortality for 2 ×2 matrices is NP-Hard
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Most computational problems for matrix semigroups and groups are inherently difficult to solve and even undecidable starting from dimension three. The questions about the decidability and complexity of problems for two-dimensional matrix semigroups remain open and are directly linked with other challenging problems in the field. In this paper we study the computational complexity of the problem of determining whether the identity matrix belongs to a matrix semigroup (the Identity Problem) generated by a finite set of 2 × 2 integral unimodular matrices. The Identity Problem for matrix semigroups is a well-known challenging problem, which has remained open in any dimension until recently. It is currently known that the problem is decidable in dimension two and undecidable starting from dimension four. In particular, we show that the Identity Problem for 2 × 2 integral unimodular matrices is NP-hard by a reduction of the Subset Sum Problem and several new encoding techniques. An upper bound for the nontrivial decidability result by C. Choffrut and J. Karhumäki is unknown. However, we derive a lower bound on the minimum length solution to the Identity Problem for a constructible set of instances, which is exponential in the number of matrices of the generator set and the maximal element of the matrices. This shows that the most obvious candidate for an NP algorithm, which is to guess the shortest sequence of matrices which multiply to give the identity matrix, does not work correctly since the certificate would have a length which is exponential in the size of the instance. Both results lead to a number of corollaries confirming the same bounds for vector reachability, scalar reachability and zero in the right upper corner problems.