Abstract
somorphism problems for finite dimensional algebras can be computationally hard. When the algebras are monomial, it is shown, refining work of Shirayanagi, that there is a simple definitive combinatorial method. However, examples show that no such criterion is possible if the class of algebras is expanded to that of diagram algebras (in the sense of Fuller). The presentation of a diagram algebra is field independent but the existence of an isomorphism between two such is not. (Subject classes: 16G30, 16P10, 20M25).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
