No label defined (Q3973350)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 16664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 16664 |
Statements
26 June 1992
0 references
defining relations
0 references
partially ordered set
0 references
word trees
0 references
finite dimensional monomial algebras
0 references
algorithm
0 references
isomorphism problem
0 references
0.7964762449264526
0 references
0.7907984256744385
0 references
0.7679625749588013
0 references
0.7672863006591797
0 references
[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.
0 references
