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

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.

This book is a blend of recent developments in theoretical and computational aspects of group theory. It presents the state-of-the-art research topics in different aspects of group theory, namely, character theory, representation theory, integral group rings, the Monster simple group, computational algorithms and methods on finite groups, finite loops, periodic groups, Camina groups and generalizations, automorphisms and non-abelian tensor product of groups. Presenting a collection of invited articles by some of the leading and highly active researchers in the theory of finite groups and their representations and the Monster group, with a focus on computational aspects, this book is of particular interest to researchers in the area of group theory and related fields of mathematics.

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.

“A refreshing collection of superb mathematical essays . . . from choosing up sides to choosing names, the topics are intriguingly nonstandard . . . First-rate.” —John Allen Paulos, author of Innumeracy A science and technology journalist and essayist whose work has appeared in multiple anthologies, Brian Hayes now presents a selection of his most memorable pieces—including the National Magazine Award–winning “Clock of Ages”—in this enjoyable volume. In addition, Hayes embellishes the collection with an overall scene-setting preface, reconfigured illustrations, and a refreshingly self-critical “Afterthoughts” section appended to each essay. “You don’t have to be a geek to appreciate Hayes’s lively, self-effacing style . . . The first essay explains how clockmakers developed the gears and linkages that enabled fabled medieval clocks to reach remarkable accuracy, as well as predict the day Easter would fall on. Other essays celebrate the notion of random numbers and why they are so hard to achieve. Numerical analysis also plays a role in economic models based on the kinetic theory of gases or simplified markets involving iterations of buying and selling. Hayes goes on to explain how statistics have been applied to compute which quarrels—from interpersonal to world wars—are the deadliest (surprising results here) . . . Challenging but rewarding for anyone intrigued by numbers.” —Kirkus Reviews “As much as any book I can name, Group Theory in the Bedroom conveys to a general audience the playfulness involved in doing mathematics: how questions arise as a form of play, how our first attempts at answering questions usually seem naive in hindsight but are crucial for finding eventual solutions, and how a good solution just feels right.” —David Austin, Notices of the AMS

This book shows new directions in group theory motivated by computer science. It reflects the transition from geometric group theory to group theory of the 21st century that has strong connections to computer science. Now that geometric group theory is drifting further and further away from group theory to geometry, it is natural to look for new tools and new directions in group theory which are present.

From the winner of the Turing Award and the Abel Prize, 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