Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Card Display
Catalogue Card Display
RAK
Title: Investigations in Algebraic Theory of Combinatorial Objects ([EBook]) / edited by I. A. Faradžev, A. A. Ivanov, M. H. Klin, A. J. Woldar. Dewey Class: 511.1 Added Personal Name: Faradžev, I. A. editor. Ivanov, A. A. editor. Klin, M. H. editor. Woldar, A. J. editor. Publication: Dordrecht : Springer Netherlands, 1994. Other name(s): SpringerLink (Online service) Physical Details: XII, 510 pages : online resource. Series: Mathematics and Its Applications, Soviet Series,0169-6378 ;; 84 ISBN: 9789401719728 System details note: Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users) Summary Note: 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.: Contents note: 1.1 Cellular rings and groups of automorphisme of graphs -- 1.2 On p-local analysis of permutation groups -- 1.3 Amorphic cellular rings -- 1.4 The subschemes of the Hamming scheme -- 1.5 A description of subrings in % MathType!MTEF!2!1!+- % feaagCart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGaamOvamaabm % aabaGaam4uamaaBaaaleaacaWGWbWaaSbaaWqaaiaaigdaaeqaaaWc % beaakiabgEna0kaadofadaWgaaWcbaGaamiCamaaBaaameaacaaIYa % aabeaaaSqabaGccqGHxdaTcaGGUaGaaiOlaiaac6cacqGHxdaTcaWG % tbWaaSbaaSqaaiaadchadaWgaaadbaGaamyBaaqabaaaleqaaaGcca % GLOaGaayzkaaaaaa!49CD!]]. ------------------------------ *** There are no holdings for this record *** -----------------------------------------------
Quick Search
Search for