The construction of a representation of loop algebras
β Scribed by Wang Zheng Dong
- Publisher
- Springer
- Year
- 1996
- Tongue
- English
- Weight
- 488 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0377-9017
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We give a simple new construction of representable relation algebras with nonβrepresentable completions. Using variations on our construction, we show that the elementary closure of the class of completely representable relation algebras is not finitely axiomatizable (Β© 2009 WILEYβVCH V
We describe an algorithmic test, using the "standard polynomial identity" (and elementary computational commutative algebra), for determining whether or not a finitely presented associative algebra has an irreducible n-dimensional representation. When n-dimensional irreducible representations do exi
We describe an algorithm for constructing irreducible representations of split semisimple Lie algebras in characteristic 0. The algorithm calculates a Gr obner basis of a certain left ideal in a universal enveloping algebra. It is shown that this algorithm runs in polynomial time if the Lie algebra