Reachability Problems in Quaternion Matrix and Rotation Semigroups

DOI10.1007/978-3-540-74456-6_32MaRDI QIDQ3525582zbMATH OpenOpenAlexFDO

Authors Paul C. Bell, Igor Potapov

Publication date 17 September 2008

Published in Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL https://dspace.lboro.ac.uk/2134/12044

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Algebraic systems of matrices (15A30) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Semigroups of transformations, relations, partitions, etc. (20M20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Reachability problems in quaternion matrix and rotation semigroups
• Vector reachability problem in \(\operatorname{SL}(2,\mathbb{Z})\)
• On the computational complexity of matrix semigroup problems
• REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS
• On undecidability bounds for matrix decision problems

Cited in

(3)

• Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\)
• The freeness problem over matrix semigroups and bounded languages
• Reachability problems in quaternion matrix and rotation semigroups

This page was built for publication: Reachability Problems in Quaternion Matrix and Rotation Semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525582)