This book is a concept-oriented treatment of the structure theory of association schemes. The generalization of Sylow’s group theoretic theorems to scheme theory arises as a consequence of arithmetical considerations about quotient schemes. The theory of Coxeter schemes (equivalent to the theory of buildings) emerges naturally and yields a purely algebraic proof of Tits’ main theorem on buildings of spherical type.

This series is devoted to the publication of high-level monographs which cover the whole spectrum of current discrete mathematics and its applications in various fields. One of its main objectives is to make available to the professional community expositions of results and foundations of methods that play an important role in both the theory and applications of discrete mathematics. Contributions which are on the borderline of discrete mathematics and related fields and which stimulate further research at the crossroads of these areas are particularly welcome.

Grothendieck’s beautiful theory of schemes permeates modern algebraic geometry and underlies its applications to number theory, physics, and applied mathematics. This simple account of that theory emphasizes and explains the universal geometric concepts behind the definitions. In the book, concepts are illustrated with fundamental examples, and explicit calculations show how the constructions of scheme theory are carried out in practice.

Association schemes are of interest to both mathematicians and statisticians and this book was written with both audiences in mind. For statisticians, it shows how to construct designs for experiments in blocks, how to compare such designs, and how to analyse data from them. The reader is only assumed to know very basic abstract algebra. For pure mathematicians, it tells why association schemes are important and develops the theory to the level of advanced research. This book arose from a course successfully taught by the author and as such the material is thoroughly class-tested. There are a great number of examples and exercises that will increase the book's appeal to both graduate students and their instructors. It is ideal for those coming either from pure mathematics or statistics backgrounds who wish to develop their understanding of association schemes.

Handbook of Combinatorics

Handbook of Combinatorics, Volume 1 focuses on basic methods, paradigms, results, issues, and trends across the broad spectrum of combinatorics. The selection first elaborates on the basic graph theory, connectivity and network flows, and matchings and extensions. Discussions focus on stable sets and claw free graphs, nonbipartite matching, multicommodity flows and disjoint paths, minimum cost circulations and flows, special proof techniques for paths and circuits, and Hamilton paths and circuits in digraphs. The manuscript then examines coloring, stable sets, and perfect graphs and embeddings and minors. The book takes a look at random graphs, hypergraphs, partially ordered sets, and matroids. Topics include geometric lattices, structural properties, linear extensions and correlation, dimension and posets of bounded degree, hypergraphs and set systems, stability, transversals, and matchings, and phase transition. The manuscript also reviews the combinatorial number theory, point lattices, convex polytopes and related complexes, and extremal problems in combinatorial geometry. The selection is a valuable reference for researchers interested in combinatorics.

This volume presents papers related to the DIMACS workshop, "Codes and Association Schemes". The articles are devoted to the following topics: applications of association schemes and of the polynomial method to properties of codes, structural results for codes, structural results for association schemes, and properties of orthogonal polynomials and their applications in combinatorics. Papers on coding theory are related to classical topics, such as perfect codes, bounds on codes, codes and combinatorial arrays, weight enumerators, and spherical designs. Papers on orthogonal polynomials provide new results on zeros and symptotic properties of standard families of polynomials encountered in coding theory. The theme of association schemes is represented by new classification results and new classes of schemes related to posets. This volume collects up-to-date applications of the theory of association schemes to coding and presents new properties of both polynomial and general association schemes. It offers a solid representation of results in problems in areas of current interest.

In this book the author aims to show the value of using topological methods in combinatorial group theory.

This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association schemes, p-ranks of configurations and similar topics. Exercises at the end of each chapter provide practice and vary from easy yet interesting applications of the treated theory, to little excursions into related topics. Tables, references at the end of the book, an author and subject index enrich the text. Spectra of Graphs is written for researchers, teachers and graduate students interested in graph spectra. The reader is assumed to be familiar with basic linear algebra and eigenvalues, although some more advanced topics in linear algebra, like the Perron-Frobenius theorem and eigenvalue interlacing are included.