Combinatorial aspects of Lie superalgebras
著者
書誌事項
Combinatorial aspects of Lie superalgebras
CRC Press, c1995
大学図書館所蔵 件 / 全18件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 225-253) and index
内容説明・目次
内容説明
Combinatorial Aspects of Lie Superalgebras emphasizes the algorithmic and computational aspects of the combinatorial techniques of Lie superalgebras. It is written primarily for mathematicians and scientists who do not have a background in the field of infinite dimensional Lie superalgebras, but who realize the potential uses of the results. Consequently, the discussions provided on the applications of Lie superalgebras theory are clear and comprehensive and, throughout the text, primary attention is given to algorithms and examples. The examples illustrate theoretical results, and the algorithms, which can be used for symbolic calculations with Lie superalgebras, are based on basic and generally applicable rules and theorems.
Combinatorial Aspects of Lie Superalgebras contains comprehensive literature citations and provides an excellent reference on the techniques and results of combinatorial theory of Lie superalgebras. Programs that have been developed by the authors for computation are included on a diskette at the back of the book, and complete directions for use are provided.
目次
Introduction
Preliminaries: Lie Superalgebras. Color Lie Superalgebras. Universal Constructions. Group Actions on Free Lie Superalgebras.
Linear Structure: Regular Words. Regular Monomials. Arrangements of Brackets. Bases of Free Color Lie Superalgebras. Dynkin-Specht-Wever Criterion. Equations in Free Lie Superalgebras. Algorithms and Examples.
Free Subalgebras: Weak Algorithm. Reduced Subsets. Main Theorem. Finitely Generated Subalgebras. Subalgebras of Infinite Rank. Algorithms and Examples.
Canonical Bases: Canonical Bases in Associative Algebras. Universal Enveloping Algebras. Canonical Bases in Lie Superalgebras. Free Products. Algorithms and Examples.
Free Differential Calculus: Universal Derivations. Jacobian Matrices. Admissible Elements. The Homogeneous Case. Rank Theorems. Automorphisms and Primitive Elements. Algorithms and Examples.
Appendix - Program Description
Bibliography. Notations. Index.
Each chapter also includes a Comments section, wherein concepts are further discussed and additional sources of information are provided
「Nielsen BookData」 より
