Algorithmic Problems in Groups and Semigroups
Algorithmic Problems in Groups and Semigroups

Author: Jean-Camille Birget

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 312

ISBN-13: 1461213886

DOWNLOAD EBOOK

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, Experimental and Applied Mathematics. The purpose of the conference was to bring together researchers with interests in algorithmic problems in group theory, semigroup theory and computer science. A particularly useful feature of this conference was that it provided a framework for exchange of ideas between the research communities in semigroup theory and group theory, and several of the papers collected here reflect this interac tion of ideas. The papers collected in this volume represent a cross section of some of the results and ideas that were discussed in the conference. They reflect a synthesis of overlapping ideas and techniques stimulated by problems concerning finite monoids, finitely presented mono ids, finitely presented groups and free groups.

Rewriting Techniques and Applications
Rewriting Techniques and Applications

Author: Nachum Dershowitz

Publisher: Springer Science & Business Media

Published: 1989

Total Pages: 598

ISBN-13: 9783540510819

DOWNLOAD EBOOK

Rewriting has always played an important role in symbolic manipulation and automated deduction systems. The theory of rewriting is an outgrowth of Combinatory Logic and the Lambda Calculus. Applications cover broad areas in automated reasoning, programming language design, semantics, and implementations, and symbolic and algebraic manipulation. The proceedings of the third International Conference on Rewriting Techniques and Applications contain 34 regular papers, covering many diverse aspects of rewriting (including equational logic, decidability questions, term rewriting, congruence-class rewriting, string rewriting, conditional rewriting, graph rewriting, functional and logic programming languages, lazy and parallel implementations, termination issues, compilation techniques, completion procedures, unification and matching algorithms, deductive and inductive theorem proving, Gröbner bases, and program synthesis). It also contains 12 descriptions of implemented equational reasoning systems. Anyone interested in the latest advances in this fast growing area should read this volume.

Essays in Group Theory
Essays in Group Theory

Author: S.M. Gersten

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 346

ISBN-13: 1461395860

DOWNLOAD EBOOK

Essays in Group Theory contains five papers on topics of current interest which were presented in a seminar at MSRI, Berkeley in June, 1985. Special mention should be given to Gromov`s paper, one of the most significant in the field in the last decade. It develops the theory of hyperbolic groups to include a version of small cancellation theory sufficiently powerful to recover deep results of Ol'shanskii and Rips. Each of the remaining papers, by Baumslag and Shalen, Gersten, Shalen, and Stallings contains gems. For example, the reader will delight in Stallings' explicit construction of free actions of orientable surface groups on R-trees. Gersten's paper lays the foundations for a theory of equations over groups and contains a very quick solution to conjugacy problem for a class of hyperbolic groups. Shalen's article reviews the rapidly expanding theory of group actions on R-trees and the Baumslag-Shalen article uses modular representation theory to establish properties of presentations whose relators are pth-powers.

Fundamentals of Computation Theory
Fundamentals of Computation Theory

Author: Maciej Liskiewicz

Publisher: Springer

Published: 2005-09-09

Total Pages: 590

ISBN-13: 3540318739

DOWNLOAD EBOOK

This volume is dedicated to the 15th Symposium on Fundamentals of Computation Theory FCT 2005, held in Lubeck, Germany, on August 17–20, 2005.

Formal Properties of Finite Automata and Applications
Formal Properties of Finite Automata and Applications

Author: Jean E. Pin

Publisher: Springer Science & Business Media

Published: 1989-10-11

Total Pages: 276

ISBN-13: 9783540516316

DOWNLOAD EBOOK

The volume contains the proceedings of the 16th Spring School on Theoretical Computer Science held in Ramatuelle, France, in May 1988. It is a unique combination of research level articles on various aspects of the theory of finite automata and its applications. Advances made in the last five years on the mathematical foundations form the first part of the book. The second part is devoted to the important problems of the theory including star-height, concatenation hierarchies, and connections with logic and word problems. The last part presents a large variety of possible applications: number theory, distributed systems, algorithms on strings, theory of codes, complexity of boolean circuits and others.

The Concise Handbook of Algebra
The Concise Handbook of Algebra

Author: Alexander V. Mikhalev

Publisher: Springer Science & Business Media

Published: 2013-06-29

Total Pages: 629

ISBN-13: 9401732671

DOWNLOAD EBOOK

It is by no means clear what comprises the "heart" or "core" of algebra, the part of algebra which every algebraist should know. Hence we feel that a book on "our heart" might be useful. We have tried to catch this heart in a collection of about 150 short sections, written by leading algebraists in these areas. These sections are organized in 9 chapters A, B, . . . , I. Of course, the selection is partly based on personal preferences, and we ask you for your understanding if some selections do not meet your taste (for unknown reasons, we only had problems in the chapter "Groups" to get enough articles in time). We hope that this book sets up a standard of what all algebraists are supposed to know in "their" chapters; interested people from other areas should be able to get a quick idea about the area. So the target group consists of anyone interested in algebra, from graduate students to established researchers, including those who want to obtain a quick overview or a better understanding of our selected topics. The prerequisites are something like the contents of standard textbooks on higher algebra. This book should also enable the reader to read the "big" Handbook (Hazewinkel 1999-) and other handbooks. In case of multiple authors, the authors are listed alphabetically; so their order has nothing to do with the amounts of their contributions.