Bibliothèque de L'IMIST/CNRST

Votre panier est vide.
IMIST


Votre recherche a retourné 4 résultats.

Computation with finitely presented groups par Sims, Charles C. Publication : Cambridge Cambridge University Press 2010 . 604 pages , Research in computational group theory, an active subfield of computational algebra, has emphasized four areas: finite permutation groups, finite solvable groups, matrix representations of finite groups, and finitely presented groups. This book deals with the last of these areas. It is the first text to present the fundamental algorithmic ideas which have been developed to compute with finitely presented groups that are infinite, or at least not obviously finite. | The work of Baumslag, Cannonito, and Miller on computing nonabelian polycyclic quotients is described as a generalization of Buchberger's Grobner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups, and theoretical computer scientists will find this book useful. 25 cm. Date : 2010 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1),

Réserver Ajouter au panier
Handbook of computational group theory par Holt, Derek F. Publication : [S.l.] Chapman and Hall/CRC 2005 . 536 p. , The origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today it remains a lively and active branch of mathematics. The Handbook of Computational Group Theory offers the first complete treatment of all the fundamental methods and algorithms in CGT presented at a level accessible even to advanced undergraduate students. It develops the theory of algorithms in full detail and highlights the connections between the different aspects of CGT and other areas of computer algebra. While acknowledging the importance of the complexity analysis of CGT algorithms, the authors' primary focus is on algorithms that perform well in practice rather than on those with the best theoretical complexity. Throughout the book, applications of all the key topics and algorithms to areas both within and outside of mathematics demonstrate how CGT fits into the wider world of mathematics and science. The authors include detailed pseudocode for all of the fundamental algorithms, and provide detailed worked examples that bring the theorems and algorithms to life. 24 cm. Date : 2005 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1),

Réserver Ajouter au panier
The theory of classes of groups / par Wenbin, Guo. Publication : [S.l.] : Springer, 2001 . 264 p. ; , This book gives a systematic introduction to the theory of classes of groups, including research subjects, major (recent) research achievements, and directions for future research. It clearly and concisely treats a wealth of topics, such as a brief introduction to the fundamental knowledge of group theory; the classical part of the theory of classes of groups covering mainly F-covering subgroups, F-projectors, F-injectors and F-normalisers; local formations; Schunck classes; Fitting classes; properties of local formations; formation constructions of finite groups and related applications; and the algebra of formations. Audience: This volume will be of interest to mathematicians involved in group theory and generalisations, algebras, order, lattices, ordered algebraic structures, general mathematical systems and the mathematics of physics and chemistry. 25 cm. Date : 2001 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1),

Réserver Ajouter au panier
Vous ne trouvez pas ce que vous cherchez ?
© Tous droits résérvés IMIST/CNRST
Angle Av. Allal Al Fassi et Av. des FAR, Hay Ryad, BP 8027, 10102 Rabat, Maroc
Tél:(+212) 05 37.56.98.00
CNRST / IMIST

Propulsé par Koha