Surveys in Combinatorics, 1995
PAYBACK Punkte
24 °P sammeln!
The fifteenth British Combinatorial Conference took place in July 1995 at the University of Stirling. This volume consists of the papers presented by the invited lecturers at the meeting, and provides an up-to-date survey of current research activity in several areas of combinatorics and its applications. These include distance-regular graphs, combinatorial designs, coding theory, spectra of graphs, and randomness and computation. The articles give an overview of combinatorics that will be extremely useful to both mathematicians and computer scientists.Table of contents:1. The Euclidean geomet...
The fifteenth British Combinatorial Conference took place in July 1995 at the University of Stirling. This volume consists of the papers presented by the invited lecturers at the meeting, and provides an up-to-date survey of current research activity in several areas of combinatorics and its applications. These include distance-regular graphs, combinatorial designs, coding theory, spectra of graphs, and randomness and computation. The articles give an overview of combinatorics that will be extremely useful to both mathematicians and computer scientists.
Table of contents:
1. The Euclidean geometry of distance regular graphs: C. Godsil; 2. Searching with lies: R. Hill; 3. Spin models for link invariants: F. Jaeger; 4. Computational Polya theory: M. Jerrum; 5. Exact and approximate mixing of random walks: L. Lovasz; 6. Cayley graphs: eigenvalues, expanders and random walks: A. Lubotzky; 7. Large sets of Steiner triple systems: A. Rosa; 8. Construction and classification of combinatorial designs: E. Spence; 9. Modern probabilistic methods in combinatorics: J. Spencer.
The fifteenth British Combinatorial Conference took place in July 1995 at the University of Stirling. This volume consists of the papers presented by the invited lecturers at the meeting, and provides an up-to-date survey of current research activity in several areas of combinatorics and its applications. These include distance-regular graphs, combinatorial designs, coding theory, spectra of graphs, and randomness and computation. The articles give an overview of combinatorics that will be extremely useful to both mathematicians and computer scientists.
These articles give an up-to-date overview of combinatorics that will be extremely useful to both mathematicians and computer scientists.
Table of contents:
1. The Euclidean geometry of distance regular graphs: C. Godsil; 2. Searching with lies: R. Hill; 3. Spin models for link invariants: F. Jaeger; 4. Computational Polya theory: M. Jerrum; 5. Exact and approximate mixing of random walks: L. Lovasz; 6. Cayley graphs: eigenvalues, expanders and random walks: A. Lubotzky; 7. Large sets of Steiner triple systems: A. Rosa; 8. Construction and classification of combinatorial designs: E. Spence; 9. Modern probabilistic methods in combinatorics: J. Spencer.
The fifteenth British Combinatorial Conference took place in July 1995 at the University of Stirling. This volume consists of the papers presented by the invited lecturers at the meeting, and provides an up-to-date survey of current research activity in several areas of combinatorics and its applications. These include distance-regular graphs, combinatorial designs, coding theory, spectra of graphs, and randomness and computation. The articles give an overview of combinatorics that will be extremely useful to both mathematicians and computer scientists.
These articles give an up-to-date overview of combinatorics that will be extremely useful to both mathematicians and computer scientists.