Abstract
A directed graph is associated to any basic tiled order, and it turns out that the graph is connected for all known examples of tiled orders of finite global dimension. It is proved that the minimal connected tiled orders of finite global dimension in a fixed algebra are of global dimension two, and that up to isomorphism, these minimal orders are characterized by their unoriented graph which is a tree. Their irreducible representations are in one-to-one correspondence with the possible orientations of this tree.
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.
