scientific article; zbMATH DE number 16664

From MaRDI portal
Publication:3973350





[For the entire collection see Zbl 0721.00009.] Let \(k\) be a field and \(A\) be a monomial algebra, that is an associative \(k\)-algebra generated by a finite number of variables having a finite number of their monomials as the defining relations. In this article, the author shows that \(A\) determines a partially ordered set called ``word tree related somewhat to the so called LSGOP. Moreover there is a one- to-one correspondence between the isomorphism classes of monomial algebras of finite-dimension over \(k\) and the isomorphism classes of word trees. As a consequence of this it is possible to construct all finite dimensional monomial algebras modulo algebra isomorphisms. Another interesting consequence is an algorithm for solving the isomorphism problem for finite dimensional monomial algebras.











This page was built for publication:

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