Algorithmic and Combinatorial Algebra

Front Cover
Springer Science & Business Media, May 31, 1994 - Computers - 384 pages
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).
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

II
1
III
2
IV
5
V
17
VI
22
VII
32
VIII
35
IX
53
XLVIII
152
XLIX
155
L
159
LI
163
LII
167
LIII
171
LIV
172
LV
174

X
54
XI
55
XII
56
XIII
57
XIV
58
XV
60
XVI
61
XVII
64
XVIII
65
XIX
66
XX
73
XXI
74
XXII
76
XXIII
84
XXIV
86
XXV
90
XXVI
92
XXVII
94
XXVIII
101
XXIX
105
XXX
106
XXXI
111
XXXII
118
XXXIII
120
XXXIV
123
XXXV
124
XXXVI
126
XXXVII
127
XXXVIII
131
XXXIX
134
XL
141
XLI
142
XLII
143
XLIII
144
XLIV
146
XLV
147
XLVI
148
XLVII
151
LVI
177
LVII
178
LVIII
182
LIX
185
LX
188
LXI
197
LXII
199
LXIII
202
LXIV
203
LXV
206
LXVI
209
LXVII
215
LXVIII
218
LXIX
222
LXX
228
LXXI
237
LXXII
240
LXXIII
256
LXXIV
262
LXXV
276
LXXVI
309
LXXVII
315
LXXVIII
323
LXXIX
325
LXXX
327
LXXXI
330
LXXXII
334
LXXXIII
335
LXXXIV
337
LXXXVI
338
LXXXVII
340
LXXXVIII
343
LXXXIX
346
XC
347
XCI
349
XCII
380
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 366 - Equations in a free group", Izv. Akad. Nauk SSSR, Ser. Mat. 46 (1982) 1199-1273. Transl. in Math. USSR Izv. 21 (1983). [Mak2] GS Makanin, "Decidability of the universal and positive theories of a free group
Page 369 - Decision Problems for Groups — Survey and Reflections, Algorithms and Classification in Combinatorial Group Theory (Berkeley, CA, 1989), Math. Sci. Res. Inst. Publ., Springer, New York, 1992, vol. 23, p. 1 - 59. [296] CF Miller III and PE Schupp, 'Embeddings into hopfian groups,
Page 355 - An analysis of Turing's 'The word problem in semigroups with cancellation,

Bibliographic information