Handbook Of Computational Group Theory

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 fundame

Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner 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.

Table of contents

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.

A comprehensive survey of computational aspects of collective decisions for graduate students, researchers, and professionals in computer science and economics.

The Handbook of Computational Social Science is a comprehensive reference source for scholars across multiple disciplines. It outlines key debates in the field, showcasing novel statistical modeling and machine learning methods, and draws from specific case studies to demonstrate the opportunities and challenges in CSS approaches. The Handbook is divided into two volumes written by outstanding, internationally renowned scholars in the field. This first volume focuses on the scope of computational social science, ethics, and case studies. It covers a range of key issues, including open science, formal modeling, and the social and behavioral sciences. This volume explores major debates, introduces digital trace data, reviews the changing survey landscape, and presents novel examples of computational social science research on sensing social interaction, social robots, bots, sentiment, manipulation, and extremism in social media. The volume not only makes major contributions to the consolidation of this growing research field but also encourages growth in new directions. With its broad coverage of perspectives (theoretical, methodological, computational), international scope, and interdisciplinary approach, this important resource is integral reading for advanced undergraduates, postgraduates, and researchers engaging with computational methods across the social sciences, as well as those within the scientifi c and engineering sectors.

This comprehensive text provides upper-level undergraduates and graduate students with an accessible introduction to the implementation of quantum ideas in molecular modeling, exploring practical applications alongside theoretical explanations. Topics include the Hartree-Fock method; matrix SCF equations; implementation of the closed-shell case; introduction to molecular integrals; and much more. 1998 edition.

An introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography