Name
Abstract | ||
|---|---|---|
This paper describes progress made in context with the construction of a general library of Lie algebra algorithms,called ELIAS (Eindhoven LIe Algebra System), within the computer algebra package GAP. A first sketch of thepackage can be found in Cohen and de Graaf[1]. Since then, in a collaborative effort with G. Ivanyos, the authorshave continued to develop algorithms which were implemented in ELIAS by the second author. These activities arepart of a bigger project, called ACELA and... |
Year | Venue | Keywords |
|---|---|---|
1997 | Discrete Mathematics & Theoretical Computer Science | lie algebra algorithms,elias,lie algebra,computer algebra |
Field | DocType | Volume |
Generalized Kac–Moody algebra,Super-Poincaré algebra,Combinatorics,Graded Lie algebra,Algebra,Universal enveloping algebra,Pure mathematics,Adjoint representation of a Lie algebra,Structure constants,Affine Lie algebra,Lie conformal algebra,Mathematics | Journal | 1 |
Issue | Citations | PageRank |
2 | 1 | 0.47 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arjeh M. Cohen | 1 | 76 | 15.45 |
| Willem A. de Graaf | 2 | 23 | 8.51 |
| Lajos Rónyai | 3 | 397 | 52.05 |