Loading…
Reachability problems in quaternion matrix and rotation semigroups
We examine computational problems on quaternion matrix and ro- tation semigroups. It is shown that in the ultimate case of quaternion matrices, in which multiplication is still associative, most of the decision problems for ma- trix semigroups are undecidable in dimension two. The geometric interpre...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Default Article |
| Published: |
2008
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/12044 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|