Publication | Open Access
Some decision problems on integer matrices
39
Citations
7
References
2005
Year
Mathematical ProgrammingTopological SemigroupsEngineeringMatrix AnalysisComputational ComplexityInteger MatricesMatrix MethodTransformation SemigroupsMatrix TheoryCombinatorial OptimizationNull MatrixInteger EntriesFinite Set
Given a finite set of matrices with integer entries, consider the question of determining whether the semigroup they generated 1) is free; 2) contains the identity matrix; 3) contains the null matrix or 4) is a group. Even for matrices of dimension 3, questions 1) and 3) are undecidable. For dimension 2, they are still open as far as we know. Here we prove that problems 2) and 4) are decidable by proving more generally that it is recursively decidable whether or not a given non singular matrix belongs to a given finitely generated semigroup.
| Year | Citations | |
|---|---|---|
Page 1
Page 1