| Investigations in Algebraic Theory of Combinatorial Objects 1994 Edition Contributor(s): Faradzev, I. a. (Editor), Ivanov, A. a. (Editor), Klin, M. (Editor) |
|
 |
ISBN: 0792319273 ISBN-13: 9780792319276 Publisher: Springer OUR PRICE: $132.99 Product Type: Hardcover - Other Formats Published: November 1993 Annotation: This volume presents an authoritative collection of major survey papers on algebraic combinatorics which originally appeared in Russian, augmented by four survey papers written specially for this book. The algebraic theory of combinatorial objects is the branch of mathematics that studies the relation between local properties of a combinatorial object and the global properties of its automorphism group. The content is divided into three parts: the first deals with cellular rings; the second deals with distance-regular and distance-transitive graphs; and part 3 contains papers on the relatively new branch of amalgams and geometry. For complex systems theorists; mathematicians interested in group theory and combinatorics. |
| Additional Information |
| BISAC Categories: - Mathematics | Discrete Mathematics - Mathematics | Group Theory - Mathematics | Combinatorics |
| Dewey: 511.6 |
| LCCN: 92027720 |
| Series: Archives Internationales D'Histoire Des Idees |
| Physical Information: 1.13" H x 6.14" W x 9.21" (2.01 lbs) 510 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: X K chendorffer, L.A. Kalu: lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this century under various names (Hecke algebras, centralizer rings, association schemes, coherent configurations, cellular rings, etc.-see the first paper of the collection for details) andin various branches of mathematics, both pure and applied. One of these approximations, the theory of cellular rings (cellular algebras), was developed at the end of the 60s by B. Yu. Weisfeiler and A.A. Leman in the course of the first serious attempt to study the complexity of the graph isomorphism problem, one of the central problems in the modern theory of combinatorial algorithms. At roughly the same time G.M. Adelson-Velskir, V.L. Arlazarov, I.A. Faradtev and their colleagues had developed a rather efficient tool for the constructive enumeration of combinatorial objects based on the branch and bound method. By means of this tool a number of "sports-like" results were obtained. Some of these results are still unsurpassed. |