9780792319276-0792319273-Investigations in Algebraic Theory of Combinatorial Objects (Mathematics and its Applications, 84)

Investigations in Algebraic Theory of Combinatorial Objects (Mathematics and its Applications, 84)

ISBN-13: 9780792319276
ISBN-10: 0792319273
Edition: 1994
Author: A.A. Ivanov, I.A. Faradzev, M. Klin, A.J. Woldar
Publication date: 1993
Publisher: Springer
Format: Hardcover 522 pages
FREE US shipping
Buy

From $127.86

Book details

ISBN-13: 9780792319276
ISBN-10: 0792319273
Edition: 1994
Author: A.A. Ivanov, I.A. Faradzev, M. Klin, A.J. Woldar
Publication date: 1993
Publisher: Springer
Format: Hardcover 522 pages

Summary

Investigations in Algebraic Theory of Combinatorial Objects (Mathematics and its Applications, 84) (ISBN-13: 9780792319276 and ISBN-10: 0792319273), written by authors A.A. Ivanov, I.A. Faradzev, M. Klin, A.J. Woldar, was published by Springer in 1993. With an overall rating of 4.5 stars, it's a notable title among other Pure Mathematics (Mathematics) books. You can easily purchase or rent Investigations in Algebraic Theory of Combinatorial Objects (Mathematics and its Applications, 84) (Hardcover) from BooksRun, along with many other new and used Pure Mathematics books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $0.3.

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.

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book