ACM Home Page
Please provide us with feedback. Feedback
Constructing bases of finitely presented Lie algebras using Gröbner bases in free algebras
Full text PdfPdf (747 KB)
Source International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1999 international symposium on Symbolic and algebraic computation table of contents
Vancouver, British Columbia, Canada
Pages: 37 - 43  
Year of Publication: 1999
ISBN:1-58113-073-2
Authors
W. A. de Graaf  School of Mathematical and Computational Sciences, University of St. Andrews, St. Andrews Scotland
J. Wisliceny  Schwaaner Str. 45, 18273 Güstrow, Germany
Sponsors
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 16,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/309831.309853
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BAHTURIN, Y. A., MIKHALEV, A. A., PETROGRAD- SKY, V. M., AND ZAIC, EV, M. V. Infinite-dimensional Lie superalgebras. XYalter de Gruyter & Co., Berlin, 1992.
 
2
BERGMA.N.G.M. The diarnond lcmma for ring theory. Adv. in Math. 29, 2 (1978), 178-218.
 
3
BOURBAKI, N. Groupes et Alg~bres de. Lie, Chapitre II. Hermann, Paris, 1972.
 
4
COHEN, A. M.. STEINBACH. A.. USHIROBIRA, a., AND WAI,ES, D. Lie algebr~ generated by extremal elements, preliminary version, December 1998.
 
5
THE GAP GROUP. GAP- Groups, Algorithms, and Programming, Version ~,. Aachen, St Andrews, 1998. (http'//www-gap. dcs. st-and, ac. uk/-gap).
 
6
 
7
 
8
LALONDE. P., ANI) RAM, A. Standaxd Lyndon bases of Lie algebras and enveloping algebras. Trans. Amer. Math. Soc. ,'}dT, 5 (1995), 1821-1830.
 
9
LINTON, S. A. On vector enumeration. Linear Algebra and its Applications 192 (1993), 235-248. Computational linear algebra in algebraic and related problems (Esse11, 1992).
 
10
 
11
SERRE, J.-P. Alg~bres de Lie semi-simples complexes. W. A. Benjamin, inc., New York-Amsterdam, 1966.
 
12
SHIRSHOV, A. I. Some algorithmic problems for Lie algebras. Sib. Mat. Zh. 3 (1962), 292-296. (Russian).
 
13
UFNAR.OVSKIJ, V. A. Combinatorial and Asymptotic Methods in Algebra, vol. 57 of Encyclopedia of Mathematical Sciences. Springer Verlag, Berlin, Heidelberg, New York, 1995, oh. I, pp. 1-196.
 
14
VAN LEEUWEN, M. i. A., AND ROELOFS, M. Termination for a class of algorithms for constructing algebras given by generators and relations. Journal of Pure and Applied Algebra 117//118 (1997), 431-445. Algorithms for algebra (Eindhoven, 1996).
 
15
 
16
VAUGHAN-LEE, M. a. Oil Zel'manov's solution of the restricted Burnside problem. J. Group Theory 1, 1 (1998), 65-94.


Collaborative Colleagues:
W. A. de Graaf: colleagues
J. Wisliceny: colleagues