José Gómez-Torrecillas - Böcker
Visar alla böcker från författaren José Gómez-Torrecillas. Handla med fri frakt och snabb leverans.
2 produkter
2 produkter
Algorithmic Methods in Non-Commutative Algebra
Applications to Quantum Groups
Inbunden, Engelska, 2003
534 kr
Skickas inom 10-15 vardagar
The already broad range of applications of ring theory has been enhanced in the 1980s by the increasing interest in algebraic structures of considerable complexity, the so-called class of quantum groups. One of the fundamental properties of quantum groups is that they are modelled by associative co-ordinate rings possessing a canonical basis, which allows for the use of algorithmic structures based on Groebner bases to study them. This book develops these methods in a self-contained way, concentrating on an in-depth study of the notion of a vast class of non-commutative rings (encompassing most quantum groups), the so-called Poincare-Birkhoff-Witt rings. Included are algorithms which treat essential aspects like ideals and (bi)modules, the calculation of homological dimension and of the Gelfand-Kirillov dimension, the Hilbert-Samuel polynomial, primality tests for prime ideals, and so on.
Del 17 - Mathematical Modelling: Theory and Applications
Algorithmic Methods in Non-Commutative Algebra
Applications to Quantum Groups
Häftad, Engelska, 2010
534 kr
Skickas inom 10-15 vardagar
The already broad range of applications of ring theory has been enhanced in the eighties by the increasing interest in algebraic structures of considerable complexity, the so-called class of quantum groups. One of the fundamental properties of quantum groups is that they are modelled by associative coordinate rings possessing a canonical basis, which allows for the use of algorithmic structures based on Groebner bases to study them. This book develops these methods in a self-contained way, concentrating on an in-depth study of the notion of a vast class of non-commutative rings (encompassing most quantum groups), the so-called Poincaré-Birkhoff-Witt rings. We include algorithms which treat essential aspects like ideals and (bi)modules, the calculation of homological dimension and of the Gelfand-Kirillov dimension, the Hilbert-Samuel polynomial, primality tests for prime ideals, etc.