Name: investigations in algebraic theory of combinatorial objects (en Inglés)
Price: 553238.00 COP
Availability: InStock
Author: Faradzev, I. a. ; Ivanov, A. a. ; Klin, M.
ISBN: 9780792319276

portada investigations in algebraic theory of combinatorial objects (en Inglés)

Formato

Libro Físico

Ilustrado por

Editorial

Autor

Faradzev, I. a. ; Ivanov, A. a. ; Klin, M.

Año

1993

Idioma

Inglés

N° páginas

510

Encuadernación

Tapa Dura

Dimensiones

23.4 x 15.6 x 2.9 cm

Peso

0.91 kg.

ISBN

0792319273

ISBN13

9780792319276

Categorías

Matemáticas discretas
Grupos matemáticos y teoría de grupos
Combinatoria y teoría de grafos

investigations in algebraic theory of combinatorial objects (en Inglés)

A. A. Ivanov (Ilustrado por) · I. a. Faradzev (Ilustrado por) · M. Klin (Ilustrado por) · Springer · Tapa Dura

Libro Nuevo

$ 553.238

$ 1.106.476

Ahorras: $ 553.238

50% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Martes 21 de Mayo y el Martes 04 de Junio.

Lo recibirás en cualquier lugar de Colombia entre 1 y 5 días hábiles luego del envío.

Reseña del libro "investigations in algebraic theory of combinatorial objects (en Inglés)"

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.