You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This volume contains the proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Geometric Group Theory and Computer Science held at Mount Holyoke College (South Hadley, MA). The conference was devoted to computational aspects of geometric group theory, a relatively young area of research which has grown out of an influx of ideas from topology and computer science into combinatorial group theory. The book reflects recent progress in this interesting new field. Included are articles about insights from computer experiments, applications of formal language theory, decision problems, and complexity problems. There is also a survey of open questions in combinatorial group theory. The volume will interest group theorists, topologists, and experts in automata and language theory.
This volume consists of contributions by speakers at the AMS Special Session on Combinatorial and Statistical Group Theory held at New York University. Readers will find a variety of contributions, including survey papers on applications of group theory in cryptography, research papers on various aspects of statistical group theory, and papers on more traditional combinatorial group theory. The book is suitable for graduate students and research mathematicians interested in group theory and its applications to cryptography.
This book gives a nice overview of the diversity of current trends in computational and statistical group theory. It presents the latest research and a number of specific topics, such as growth, black box groups, measures on groups, product replacement algorithms, quantum automata, and more. It includes contributions by speakers at AMS Special Sessions at The University of Nevada (Las Vegas) and the Stevens Institute of Technology (Hoboken, NJ). It is suitable for graduate students and research mathematicians interested in group theory.
This volume assembles several research papers in all areas of geometric and combinatorial group theory originated in the recent conferences in Dortmund and Ottawa in 2007. It contains high quality refereed articles developing new aspects of these modern and active fields in mathematics. It is also appropriate to advanced students interested in recent results at a research level.
This volume contains papers which are based primarily on talks given at an inter national conference on Algorithmic Problems in Groups and Semigroups held at the University of Nebraska-Lincoln from May ll-May 16, 1998. The conference coincided with the Centennial Celebration of the Department of Mathematics and Statistics at the University of Nebraska-Lincoln on the occasion of the one hun dredth anniversary of the granting of the first Ph.D. by the department. Funding was provided by the US National Science Foundation, the Department of Math ematics and Statistics, and the College of Arts and Sciences at the University of Nebraska-Lincoln, through the College's focus program in Discrete, Ex...
This volume grew out of two AMS conferences held at Columbia University (New York, NY) and the Stevens Institute of Technology (Hoboken, NJ) and presents articles on a wide variety of topics in group theory. Readers will find a variety of contributions, including a collection of over 170 open problems in combinatorial group theory, three excellent survey papers (on boundaries of hyperbolic groups, on fixed points of free group automorphisms, and on groups of automorphisms of compactRiemann surfaces), and several original research papers that represent the diversity of current trends in combinatorial and geometric group theory. The book is an excellent reference source for graduate students and research mathematicians interested in various aspects of group theory.
Examines the relationship between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups can be used in public key cryptography. It also shows that there is remarkable feedback from cryptography to combinatorial group theory because some of the problems motivated by cryptography appear to be new to group theory.
This book offers a panorama of recent advances in the theory of infinite groups. It contains survey papers contributed by leading specialists in group theory and other areas of mathematics. Topics include amenable groups, Kaehler groups, automorphism groups of rooted trees, rigidity, C*-algebras, random walks on groups, pro-p groups, Burnside groups, parafree groups, and Fuchsian groups. The accent is put on strong connections between group theory and other areas of mathematics.
The focus of algorithmic group theory shifted from the decidability/undecidability type of result to the complexity of algorithms. This title contains papers that reflect that paradigm shift. It presents articles that are based on the AMS/ASL Joint Special Session, Interactions Between Logic, Group Theory and Computer Science.
This volume contains contributions by the participants of the conference "Groups and Computation", which took place at The Ohio State University in Columbus, Ohio, in June 1999. This conference was the successor of two workshops on "Groups and Computation" held at DIMACS in 1991 and 1995. There are papers on permutation group algorithms, finitely presented groups, polycyclic groups, and parallel computation, providing a representative sample of the breadth of Computational Group Theory. On the other hand, more than one third of the papers deal with computations in matrix groups, giving an in-depth treatment of the currently most active area of the field. The points of view of the papers range from explicit computations to group-theoretic algorithms to group-theoretic theorems needed for algorithm development.