The 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é-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.

Describing many of the most important aspects of Lie group theory, this book presents the subject in a 'hands on' way. Rather than concentrating on theorems and proofs, the book shows the applications of the material to physical sciences and applied mathematics. Many examples of Lie groups and Lie algebras are given throughout the text. The relation between Lie group theory and algorithms for solving ordinary differential equations is presented and shown to be analogous to the relation between Galois groups and algorithms for solving polynomial equations. Other chapters are devoted to differential geometry, relativity, electrodynamics, and the hydrogen atom. Problems are given at the end of each chapter so readers can monitor their understanding of the materials. This is a fascinating introduction to Lie groups for graduate and undergraduate students in physics, mathematics and electrical engineering, as well as researchers in these fields.

The purpose of this book is to serve as a tool for researchers and practitioners who apply Lie algebras and Lie groups to solve problems arising in science and engineering. The authors address the problem of expressing a Lie algebra obtained in some arbitrary basis in a more suitable basis in which all essential features of the Lie algebra are directly visible. This includes algorithms accomplishing decomposition into a direct sum, identification of the radical and the Levi decomposition, and the computation of the nilradical and of the Casimir invariants. Examples are given for each algorithm. For low-dimensional Lie algebras this makes it possible to identify the given Lie algebra completely. The authors provide a representative list of all Lie algebras of dimension less or equal to 6 together with their important properties, including their Casimir invariants. The list is ordered in a way to make identification easy, using only basis independent properties of the Lie algebras. They also describe certain classes of nilpotent and solvable Lie algebras of arbitrary finite dimensions for which complete or partial classification exists and discuss in detail their construction and properties. The book is based on material that was previously dispersed in journal articles, many of them written by one or both of the authors together with their collaborators. The reader of this book should be familiar with Lie algebra theory at an introductory level. Titles in this series are co-published with the Centre de Recherches Mathématiques.

This book explains deep learning concepts and derives semi-supervised learning and nuclear learning frameworks based on cognition mechanism and Lie group theory. Lie group machine learning is a theoretical basis for brain intelligence, Neuromorphic learning (NL), advanced machine learning, and advanced artifi cial intelligence. The book further discusses algorithms and applications in tensor learning, spectrum estimation learning, Finsler geometry learning, Homology boundary learning, and prototype theory. With abundant case studies, this book can be used as a reference book for senior college students and graduate students as well as college teachers and scientific and technical personnel involved in computer science, artifi cial intelligence, machine learning, automation, mathematics, management science, cognitive science, financial management, and data analysis. In addition, this text can be used as the basis for teaching the principles of machine learning. Li Fanzhang is professor at the Soochow University, China. He is director of network security engineering laboratory in Jiangsu Province and is also the director of the Soochow Institute of industrial large data. He published more than 200 papers, 7 academic monographs, and 4 textbooks. Zhang Li is professor at the School of Computer Science and Technology of the Soochow University. She published more than 100 papers in journals and conferences, and holds 23 patents. Zhang Zhao is currently an associate professor at the School of Computer Science and Technology of the Soochow University. He has authored and co-authored more than 60 technical papers.

The purpose of this book is to serve as a tool for researchers and practitioners who apply Lie algebras and Lie groups to solve problems arising in science and engineering. The authors address the problem of expressing a Lie algebra obtained in some arbitrary basis in a more suitable basis in which all essential features of the Lie algebra are directly visible. This includes algorithms accomplishing decomposition into a direct sum, identification of the radical and the Levi decomposition, and the computation of the nilradical and of the Casimir invariants. Examples are given for each algorithm. For low-dimensional Lie algebras this makes it possible to identify the given Lie algebra completely. The authors provide a representative list of all Lie algebras of dimension less or equal to 6 together with their important properties, including their Casimir invariants. The list is ordered in a way to make identification easy, using only basis independent properties of the Lie algebras. They also describe certain classes of nilpotent and solvable Lie algebras of arbitrary finite dimensions for which complete or partial classification exists and discuss in detail their construction and properties. The book is based on material that was previously dispersed in journal articles, many of them written by one or both of the authors together with their collaborators. The reader of this book should be familiar with Lie algebra theory at an introductory level.

The 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é-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.

Algebra and number theory have always been counted among the most beautiful mathematical areas with deep proofs and elegant results. However, for a long time they were not considered that important in view of the lack of real-life applications. This has dramatically changed: nowadays we find applications of algebra and number theory frequently in our daily life. This book focuses on the theory and algorithms for polynomials over various coefficient domains such as a finite field or ring. The operations on polynomials in the focus are factorization, composition and decomposition, basis computation for modules, etc. Algorithms for such operations on polynomials have always been a central interest in computer algebra, as it combines formal (the variables) and algebraic or numeric (the coefficients) aspects. The papers presented were selected from the Workshop on Computer Algebra and Polynomials, which was held in Linz at the Johann Radon Institute for Computational and Applied Mathematics (RICAM) during November 25-29, 2013, at the occasion of the Special Semester on Applications of Algebra and Number Theory.

Designed as a self-contained account of a number of key algorithmic problems and their solutions for linear algebraic groups, this book combines in one single text both an introduction to the basic theory of linear algebraic groups and a substantial collection of useful algorithms. Computation with Linear Algebraic Groups offers an invaluable guide to graduate students and researchers working in algebraic groups, computational algebraic geometry, and computational group theory, as well as those looking for a concise introduction to the theory of linear algebraic groups.

Even three decades ago, the words 'combinatorial algebra' contrasting, for in stance, the words 'combinatorial topology,' were not a common designation for some branch of mathematics. The collocation 'combinatorial group theory' seems to ap pear first as the title of the book by A. Karras, W. Magnus, and D. Solitar [182] and, later on, it served as the title of the book by R. C. Lyndon and P. Schupp [247]. Nowadays, specialists do not question the existence of 'combinatorial algebra' as a special algebraic activity. The activity is distinguished not only by its objects of research (that are effectively given to some extent) but also by its methods (ef fective to some extent). To be more exact, we could approximately define the term 'combinatorial algebra' for the purposes of this book, as follows: So we call a part of algebra dealing with groups, semi groups , associative algebras, Lie algebras, and other algebraic systems which are given by generators and defining relations {in the first and particular place, free groups, semigroups, algebras, etc. )j a part in which we study universal constructions, viz. free products, lINN-extensions, etc. j and, finally, a part where specific methods such as the Composition Method (in other words, the Diamond Lemma, see [49]) are applied. Surely, the above explanation is far from covering the full scope of the term (compare the prefaces to the books mentioned above).