Danny Lara (Mathematics)
Arbitrary finite dimensional K-algebras have been classified into three types by the famous theorem of Drozd by their representation type. These categories are Representation Finite, Tame, and Wild. Our focus is on Algebras of Wild Representation type. As the name suggest, the indecomposable representations of these algebras are not feasible to classify. In fact, it’s impossible. However, Dense Orbit Algebras that are of wild representation type seem to have finitely many representations (up to a certain equivalence) that satisfy a geometric property. There are very few examples of such algebras in the current literature. We explore a particular algebra of wild representation type and show, via a computational algorithm, that the algebra is a Dense Orbit Algebra.
Keywords: Dense, Algebras, Computer algorithm