Algorithmic and combinatorial algebra
Author(s)
Bibliographic Information
Algorithmic and combinatorial algebra
(Mathematics and its applications, v. 255)
Kluwer Academic, c1994
- : acid-free
Available at 31 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
: acid-freeBOK||1||194027073
Note
Bibliography: p. 349-379
Includes index
Description and Table of Contents
Description
Even three decades ago, the words 'combinatorial algebra' contrasting, for in stance, the words 'combinatorial topology,' were not a common designation for some branch of mathematics. The collocation 'combinatorial group theory' seems to ap pear first as the title of the book by A. Karras, W. Magnus, and D. Solitar [182] and, later on, it served as the title of the book by R. C. Lyndon and P. Schupp [247]. Nowadays, specialists do not question the existence of 'combinatorial algebra' as a special algebraic activity. The activity is distinguished not only by its objects of research (that are effectively given to some extent) but also by its methods (ef fective to some extent). To be more exact, we could approximately define the term 'combinatorial algebra' for the purposes of this book, as follows: So we call a part of algebra dealing with groups, semi groups , associative algebras, Lie algebras, and other algebraic systems which are given by generators and defining relations {in the first and particular place, free groups, semigroups, algebras, etc. )j a part in which we study universal constructions, viz. free products, lINN-extensions, etc. j and, finally, a part where specific methods such as the Composition Method (in other words, the Diamond Lemma, see [49]) are applied. Surely, the above explanation is far from covering the full scope of the term (compare the prefaces to the books mentioned above).
Table of Contents
1. Composition Method for Associative Algebras. 2. Free Lie Algebras. 3. The Composition Method in the Theory of Lie Algebras. 4. Amalgamated Products of Lie Algebras. 5. Decision Problems and Embedding Theorems in the Theory of Varieties of Lie Algebras. 6. The Word Problem and Embedding Theorems in the Theory of the Varieties of Groups. 7. The Problem of Endomorph Reducibility and Relatively Free Groups with the Word Problem Undecidable. 8. The Constructive Method in the Theory of HNN-Extensions. Groups with Standard Normal Form. 9. The Constructive Method for HNN-Extensions and the Conjugacy Problem for Novikov-Boone Groups. A1: Calculations in Free Groups. A2: Algorithmic Properties of Wreath Products of Groups. A3: Survey of the Theory of Absolutely Free Algebras. Bibliography. Index.
by "Nielsen BookData"