𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Automatic construction of finite algebras

✍ Scribed by Jian Zhang

Book ID
112947458
Publisher
Springer
Year
1995
Tongue
English
Weight
389 KB
Volume
10
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Constructing Irreducible Representations
Constructing Irreducible Representations of Finitely Presented Algebras
✍ Edward S. Letzter πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 245 KB

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

Construction of Finitely Presented Lie A
Construction of Finitely Presented Lie Algebras and Superalgebras
✍ VLADIMIR P. GERDT; VLADIMIR V KORNYAK πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 455 KB

We consider the following problem: what is the most general Lie algebra or superalgebra satisfying a given set of Lie polynomial equations? The presentation of Lie (super)algebras by a finite set of generators and defining relations is one of the most general mathematical and algorithmic schemes of

Constructions in Finite Geometry Using C
Constructions in Finite Geometry Using Computer Algebra Systems
✍ G.L. Ebert πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 271 KB

One way of using a computer algebra system to do research in finite geometry is to use the system to construct "small" order examples of various constructions, and then hope to recognize a pattern that can be generalized and eventually proven. Of course, initially one does not know if the "small" or