Algorithms And Classification In Combinatorial Group Theory

The papers in this volume are the result of a workshop held in January 1989 at the Mathematical Sciences Research Institute. Topics covered include decision problems, finitely presented simple groups, combinatorial geometry and homology, and automatic groups and related topics.

Combinatorial group theory is a loosely defined subject, with close connections to topology and logic. With surprising frequency, problems in a wide variety of disciplines, including differential equations, automorphic functions and geometry, have been distilled into explicit questions about groups, typically of the following kind: Are the groups in a given class finite (e.g., the Burnside problem)? Finitely generated? Finitely presented? What are the conjugates of a given element in a given group? What are the subgroups of that group? Is there an algorithm for deciding for every pair of groups in a given class whether they are isomorphic or not? The objective of combinatorial group theory is the systematic development of algebraic techniques to settle such questions. In view of the scope of the subject and the extraordinary variety of groups involved, it is not surprising that no really general theory exists. These notes, bridging the very beginning of the theory to new results and developments, are devoted to a number of topics in combinatorial group theory and serve as an introduction to the subject on the graduate level.

From the reviews: "This book [...] defines the boundaries of the subject now called combinatorial group theory. [...] it is a considerable achievement to have concentrated a survey of the subject into 339 pages. [...] a valuable and welcome addition to the literature, containing many results not previously available in a book. It will undoubtedly become a standard reference." Mathematical Reviews

Group testing has been used in medical, chemical and electrical testing, coding, drug screening, pollution control, multiaccess channel management, and recently in data verification, clone library screening and AIDS testing. The mathematical model can be either combinatorial or probabilistic. This book summarizes all important results under the combinatorial model, and demonstrates their applications in real problems. Some other search problems, including the famous counterfeit-coins problem, are also studied in depth. There are two reasons for publishing a second edition of this book. The first is the usual need to update the text (after six years) and correct errors. The second -- and more important -- reason is to accommodate the recent sudden growth of interest in applying the idea of group testing to clone library screening. This development is much more than just a new application, since the new application brings with it new objectives which require a new twist of theory. It also embraces the growing importance of two topics: nonadaptive algorithms and error tolerance. Two new chapters, one on clone library screening and the other on error tolerance, have been added. Also included is a new chapter on counterfeit coins, the most famous search problem historically, which recently drew on an unexpected connection to some deep mathematical theory to yield new results. Finally, the chapters have been recognized into parts to provide focuses and perspectives.

Group theory and topology are closely related. The region of their interaction, combining the logical clarity of algebra with the depths of geometric intuition, is the subject of Combinatorial Group Theory and Topology. The work includes papers from a conference held in July 1984 at Alta Lodge, Utah. Contributors to the book include Roger Alperin, Hyman Bass, Max Benson, Joan S. Birman, Andrew J. Casson, Marshall Cohen, Donald J. Collins, Robert Craggs, Michael Dyer, Beno Eckmann, Stephen M. Gersten, Jane Gilman, Robert H. Gilman, Narain D. Gupta, John Hempel, James Howie, Roger Lyndon, Martin Lustig, Lee P. Neuwirth, Andrew J. Nicas, N. Patterson, John G. Ratcliffe, Frank Rimlinger, Caroline Series, John R. Stallings, C. W. Stark, and A. Royce Wolf.

Read Write Inc. Fresh Start is a specially adapted literacy programme for all pupils in Years 5, 6 and 7 who are working below National Curriculum level 3. Like Read Write Inc. Phonics for pupils in the early years, the scheme starts by introducing pupils to all the letter sounds through use of the Speed Sounds cards and the green and red flashcards.Pupils progress through these sets of workbooks at their own pace, after they have completed the Introductory module. Modules 1-10 include both fiction and non-fiction texts and cover a range of cross-curricular topics. Practise in writing, spelling, editing and comprehension is provided at every level.

Group testing was first proposed for blood tests, but soon found its way to many industrial applications. Combinatorial group testing studies the combinatorial aspect of the problem and is particularly related to many topics in combinatorics, computer science and operations research. Recently, the idea of combinatorial group testing has been applied to experimental designs, coding, multiaccess computer communication, clone library screening and other fields. This book is the first attempt to cover the theory and applications of combinatorial group testing in one place. Contents:IntroductionGeneral AlgorithmsAlgorithms for Special CasesNonadaptive Algorithms and Binary Superimposed CodesMultiaccess Channels and ExtensionsSome Other Group Testing ModelsCompetitive Group TestingUnreliable Tests, Optimal Search in One VariableUnbounded SearchGroup Testing on GraphsMembership ProblemsComplexity IssuesIndex Readership: Researchers in applied mathematics, operations research, computer science, genetics statistics and public health. keywords:Group Testing;Competitive Algorithm;Nonadaptive Algorithm;Superimposed Code;Multiaccess Channel;Membership Problem;Search on Graph;Unreliable Test;Complexity;Chip Game “The book under review for the first time collects all theory and applications about combinatorial group testing in one place. The presentation of the material is well organized, the material is illustrated by many examples. This book may not only serve as a source and reference book, but is also attractive to students since it treats interesting ‘real life’ problems.” Monatshefte Für Mathematik