Graph Theory, Coding Theory and Block Designs


Book Description

These are notes deriving from lecture courses given by the authors in 1973 at Westfield College, London. The lectures described the connection between the theory of t-designs on the one hand, and graph theory on the other. A feature of this book is the discussion of then-recent construction of t-designs from codes. Topics from a wide range of finite combinatorics are covered and the book will interest all scholars of combinatorial theory.




Graph Theory, Coding Theory and Block Designs


Book Description

These are notes deriving from lecture courses on the theory of t-designs and graph theory given by the authors in 1973 at Westfield College, London.




Designs and Their Codes


Book Description

A self-contained account suited for a wide audience describing coding theory, combinatorial designs and their relations.




Hypergraphs and Designs


Book Description

Combinatorial designs represent an important area of contemporary discrete mathematics closely related to such fields as finite geometries, regular graphs and multigraphs, factorisations of graphs, linear algebra, number theory, finite fields, group and quasigroup theory, Latin squares, and matroids. It has a history of more than 150 years when it started as a collection of unrelated problems. Nowadays the field is a well-developed theory with deep mathematical results and a wide range of applications in coding theory, cryptography, computer science, and other areas. In the most general setting, a combinatorial design consists of a ground set of elements and a collection of subsets of these elements satisfying some specific restrictions; the latter are often expressed in the language of graphs. On the other side, hypergraph theory is a relatively new field which started in early 60s of the last century as a generalization of graph theory. A hypergraph consists of a ground set of elements and a collection of subsets of these elements without any specific restrictions. In this sense the concept of hypergraph is more general than the concept of combinatorial design. While it started as a generalization of graph theory, hypergraph theory soon became a separate subject because many new properties have been discovered that miss or degenerate in graphs. Compared to graph theory, the language of hypergraphs not only allows us to formulate and solve more general problems, it also helps us to understand and solve several graph theory problems by simplifying and unifying many previously unrelated concepts. The main feature of this book is applying the hypergraph approach to the theory of combinatorial designs. An alternative title of it could be "Combinatorial designs as hypergraphs". There is no analogue to this book on the market. Its primary audience is researchers and graduate students taking courses in design theory, combinatorial geometry, finite geometry, discrete mathematics, graph theory, combinatorics, cryptography, information and coding theory, and similar areas. The aim of this book is to show the connection and mutual benefit between hypergraph theory and design theory. It does not intend to give a survey of all important results or methods in any of these subjects.




Investigations in Algebraic Theory of Combinatorial Objects


Book 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.




Aspects of Combinatorics


Book Description

Combinatorics is a broad and important area of mathematics, and this textbook provides the beginner with the ideal introduction to many of the different aspects of the subject.




Surveys in Combinatorics, 1991


Book Description

This volume contains the invited papers presented at the British Combinatorial Conference, held at the University of Surrey in July 1991.




Introduction to Global Variational Geometry


Book Description

This book provides a comprehensive introduction to modern global variational theory on fibred spaces. It is based on differentiation and integration theory of differential forms on smooth manifolds, and on the concepts of global analysis and geometry such as jet prolongations of manifolds, mappings, and Lie groups. The book will be invaluable for researchers and PhD students in differential geometry, global analysis, differential equations on manifolds, and mathematical physics, and for the readers who wish to undertake further rigorous study in this broad interdisciplinary field. Featured topics- Analysis on manifolds- Differential forms on jet spaces - Global variational functionals- Euler-Lagrange mapping - Helmholtz form and the inverse problem- Symmetries and the Noether's theory of conservation laws- Regularity and the Hamilton theory- Variational sequences - Differential invariants and natural variational principles- First book on the geometric foundations of Lagrange structures- New ideas on global variational functionals - Complete proofs of all theorems - Exact treatment of variational principles in field theory, inc. general relativity- Basic structures and tools: global analysis, smooth manifolds, fibred spaces




Graph Theory with Applications to Engineering and Computer Science


Book Description

Because of its inherent simplicity, graph theory has a wide range of applications in engineering, and in physical sciences. It has of course uses in social sciences, in linguistics and in numerous other areas. In fact, a graph can be used to represent almost any physical situation involving discrete objects and the relationship among them. Now with the solutions to engineering and other problems becoming so complex leading to larger graphs, it is virtually difficult to analyze without the use of computers. This book is recommended in IIT Kharagpur, West Bengal for B.Tech Computer Science, NIT Arunachal Pradesh, NIT Nagaland, NIT Agartala, NIT Silchar, Gauhati University, Dibrugarh University, North Eastern Regional Institute of Management, Assam Engineering College, West Bengal Univerity of Technology (WBUT) for B.Tech, M.Tech Computer Science, University of Burdwan, West Bengal for B.Tech. Computer Science, Jadavpur University, West Bengal for M.Sc. Computer Science, Kalyani College of Engineering, West Bengal for B.Tech. Computer Science. Key Features: This book provides a rigorous yet informal treatment of graph theory with an emphasis on computational aspects of graph theory and graph-theoretic algorithms. Numerous applications to actual engineering problems are incorpo-rated with software design and optimization topics.




Homological Group Theory


Book Description

Eminent mathematicians have presented papers on homological and combinatorial techniques in group theory. The lectures are aimed at presenting in a unified way new developments in the area.