On the isomorphism problem for finite dimensional diagram algebras (Q4237130)

The authors show that the decision problem for the isomorphism of locally finite dimensional algebras is undecidable. All algebras considered here are quotients \(A=K\Gamma/I\) where \(K\) is a field, \(\Gamma\) is a finite quiver, \(K\Gamma\) is the path algebra of \(\Gamma\) over \(K\) and \(I\) is the ideal generated by a finite set of linear combinations of paths of length at least 2. The algebra \(A\) is called monomial if \(I\) is generated by a set of paths. \(A\) is binomial if \(I\) is generated by linear combinations of two paths. \(A\) is a diagram algebra if \(I\) is generated by paths and differences of 2 paths. Theorem 1: Let \(A\), \(B\) be monomial algebras. Then \(A\), \(B\) are isomorphic algebras iff \((A;\cdot)\), \((B;\cdot)\) are isomorphic semigroups with \(0\). The authors give examples of algebras \(A_i=K\Gamma/I_i\), \(i=1,2\) where \(\Gamma\) is the quiver with one vertex and \(4\) directed loops, \(A_1\) is monomial and \(A_2\) is diagram. The algebras \(A_1\), \(A_2\) are such that when \(K\) is of characteristic \(2\), \(A_1\) is not isomorphic to \(A_2\) and when \(K\) is not of characteristic \(2\), \(A_1\cong A_2\).