We present in these notes some typical examples of tame algebras: where they first appeared and what their "typical" properties are. In the beginning an algebra was called tame if its finitely generated modules could be completely classified. Only later, with Drozd's tame-wild dichotomy in mind, a precise definition was used: an algebra is tame if its indecomposable modules in every fixed dimension occur in a finite number of one-parameter families.
展开▼
