This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by
Algorithmic and Combinatorial Algebra
β Scribed by L. A. Bokutβ, G. P. Kukin (auth.)
- Publisher
- Springer Netherlands
- Year
- 1994
- Tongue
- English
- Leaves
- 398
- Series
- Mathematics and Its Applications 255
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
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
Front Matter....Pages i-xvi
Composition Method for Associative Algebras....Pages 1-52
Free Lie Algebras....Pages 53-103
The Composition Method in the Theory of Lie Algebras....Pages 105-139
Amalgamated Products of Lie Algebras....Pages 141-176
The Problem of Endomorph Reducibility and Relatively Free Groups with the Word Problem Unsolvable....Pages 177-208
The Constructive Method in the Theory of HNN-extensions. Groups with Standard Normal form....Pages 209-236
The Constructive Method for HNN-extensions and the Conjugacy Problem for Novikov-Boone Groups....Pages 237-314
Back Matter....Pages 315-384
β¦ Subjects
Algebra; Algorithms
π SIMILAR VOLUMES
<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a poin
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a poin
<p><P>This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries with a special emphasis on algorithmic aspects and the use of the theory of GrΓΆbner bases. </P><P>Topics covered include coherent configu