Combinatorial Aspects of Lie Superalgebras - Alexander A. Mikhalev, Andrej A. Zolotykh

Combinatorial Aspects of Lie Superalgebras

Buch | Hardcover
272 Seiten
1995
Crc Press Inc (Verlag)
978-0-8493-8960-3 (ISBN)
87,25 inkl. MwSt
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
This work focuses on the algorithmic and computational aspects of the combinatorial techniques of Lie superalgebras. Examples are given which illustrate theoretical results, and the algorithms are based on basic rules and theorems. The text comes with a diskette containing programs for computation.
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

Erscheint lt. Verlag 9.6.1995
Verlagsort Bosa Roca
Sprache englisch
Maße 156 x 234 mm
Gewicht 604 g
Einbandart gebunden
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Algebra
Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-8493-8960-7 / 0849389607
ISBN-13 978-0-8493-8960-3 / 9780849389603
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
37,99
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
34,99
Eine Einführung in die Systemtheorie

von Margot Berghaus

Buch | Softcover (2022)
UTB (Verlag)
25,00