000			03406cam a2200517Ia 4500
001			ocn162130917
003			OCoLC
005			20141103172224.0
006			m o d
007			cr cn|||||||||
008			070802s2000 ne ob 001 0 eng d
040			_aOPELS _beng _cOPELS _dOPELS _dOCLCQ _dOCLCF _dDEBBG
020			_a9780444501165
020			_a0444501169
029	1		_aNZ1 _b12432961
029	1		_aAU@ _b000048130055
029	1		_aNZ1 _b15192842
029	1		_aDEBBG _bBV036962266
035			_a(OCoLC)162130917
037			_a122749:127728 _bElsevier Science & Technology _nhttp://www.sciencedirect.com
050		4	_aQA252.3 _b.D4 2000eb
072		7	_aQA _2lcco
082	0	4	_a512/.55 _222
049			_aTEFA
100	1		_aDe Graaf, Willem A.
245	1	0	_aLie algebras _h[electronic resource] : _btheory and algorithms / _cWillem A. de Graaf.
250			_a1st ed.
260			_aAmsterdam ; _aNew York : _bElsevier, _c2000.
300			_a1 online resource (xii, 393 p.)
490	1		_aNorth-Holland mathematical library ; _vv. 56
520			_aThe aim of the present work is two-fold. Firstly it aims at a giving an account of many existing algorithms for calculating with finite-dimensional Lie algebras. Secondly, the book provides an introduction into the theory of finite-dimensional Lie algebras. These two subject areas are intimately related. First of all, the algorithmic perspective often invites a different approach to the theoretical material than the one taken in various other monographs (e.g., [42], [48], [77], [86]). Indeed, on various occasions the knowledge of certain algorithms allows us to obtain a straightforward proof of theoretical results (we mention the proof of the Poincar�e-Birkhoff-Witt theorem and the proof of Iwasawa's theorem as examples). Also proofs that contain algorithmic constructions are explicitly formulated as algorithms (an example is the isomorphism theorem for semisimple Lie algebras that constructs an isomorphism in case it exists). Secondly, the algorithms can be used to arrive at a better understanding of the theory. Performing the algorithms in concrete examples, calculating with the concepts involved, really brings the theory of life.
505	0		_aBasic constructions. On nilpotency and colvability. Cartan subalgebras. Lie algebras with non-degenerate Killing form. The classification of the simple Lie algebras. Universal enveloping algebras. Finitely presented Lie algebras. Representations of semisimple Lie algebras. On associative algebras. Bibliography. Index of Symbols. Index of Terminology. Index of Algorithms.
504			_aIncludes bibliographical references (p. [379]-386) and index.
588			_aDescription based on print version record.
650		0	_aLie algebras.
650	1	7	_aLie-algebra's. _2gtt
650	1	7	_aAlgoritmen. _2gtt
650		7	_aLie algebras. _2fast _0(OCoLC)fst00998125
655		4	_aElectronic books.
776	0	8	_iPrint version: _aDe Graaf, Willem A. _tLie algebras. _b1st ed. _dAmsterdam ; New York : Elsevier, 2000 _z0444501169 _z9780444501165 _w(DLC) 99086891 _w(OCoLC)43114263
830		0	_aNorth-Holland mathematical library ; _vv. 56.
856	4	0	_3ScienceDirect _uhttp://www.sciencedirect.com/science/book/9780444501165
856	4		_uhttp://www.sciencedirect.com/science/publication?issn=09246509&volume=56 _3Volltext
942			_cEB
994			_aC0 _bTEF
999			_c21755 _d21755