Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds


Book Description

In 1937 there appeared a paper that was to have a profound influence on the progress of combinatorial enumeration, both in its theoretical and applied aspects. Entitled Kombinatorische Anzahlbest immungen jUr Gruppen, Graphen und chemische Verbindungen, it was published in Acta Mathematica, Vol. 68, pp. 145 to 254. Its author, George Polya, was already a mathematician of considerable stature, well-known for outstanding work in many branches of mathematics, particularly analysis. The paper in Question was unusual in that it depended almost entirely on a single theorem -- the "Hauptsatz" of Section 4 -- a theorem which gave a method for solving a general type of enumera tion problem. On the face of it, this is not something that one would expect to run to over 100 pages. Yet the range of the applica tions of the theorem and of its ramifications was enormous, as Polya clearly showed. In the various sections of his paper he explored many applications to the enumeration of graphs, principally trees, and of chemical isomers, using his theorem to present a comprehen sive and unified treatment of problems which had previously been solved, if at all, only by ad hoc methods. In the final section he investigated the asymptotic properties of these enumerational results, bringing to bear his formidable insight as an analyst







Combinatorics And Graph Theory - Proceedings Of The Spring School And International Conference On Combinatorics


Book Description

This volume contains selected papers presented at the Spring School and International Conference on Combinatorics. Topics discussed include: Enumeration, Design, Graphs, Hypergraphs and Combinatorial Optimization, etc. Covering a broad range, this book should appeal to a wide spectrum of researchers in combinatorics and graph theory.




Handbook of Combinatorics


Book Description

Handbook of Combinatorics




Combinatorics


Book Description

A mathematical gem–freshly cleaned and polished This book is intended to be used as the text for a first course in combinatorics. the text has been shaped by two goals, namely, to make complex mathematics accessible to students with a wide range of abilities, interests, and motivations; and to create a pedagogical tool, useful to the broad spectrum of instructors who bring a variety of perspectives and expectations to such a course. Features retained from the first edition: Lively and engaging writing style Timely and appropriate examples Numerous well-chosen exercises Flexible modular format Optional sections and appendices Highlights of Second Edition enhancements: Smoothed and polished exposition, with a sharpened focus on key ideas Expanded discussion of linear codes New optional section on algorithms Greatly expanded hints and answers section Many new exercises and examples




Combinatorics and Graph Theory


Book Description

These notes were first used in an introductory course team taught by the authors at Appalachian State University to advanced undergraduates and beginning graduates. The text was written with four pedagogical goals in mind: offer a variety of topics in one course, get to the main themes and tools as efficiently as possible, show the relationships between the different topics, and include recent results to convince students that mathematics is a living discipline.




Combinatorics: Ancient & Modern


Book Description

Who first presented Pascal's triangle? (It was not Pascal.) Who first presented Hamiltonian graphs? (It was not Hamilton.) Who first presented Steiner triple systems? (It was not Steiner.) The history of mathematics is a well-studied and vibrant area of research, with books and scholarly articles published on various aspects of the subject. Yet, the history of combinatorics seems to have been largely overlooked. This book goes some way to redress this and serves two main purposes: 1) it constitutes the first book-length survey of the history of combinatorics; and 2) it assembles, for the first time in a single source, researches on the history of combinatorics that would otherwise be inaccessible to the general reader. Individual chapters have been contributed by sixteen experts. The book opens with an introduction by Donald E. Knuth to two thousand years of combinatorics. This is followed by seven chapters on early combinatorics, leading from Indian and Chinese writings on permutations to late-Renaissance publications on the arithmetical triangle. The next seven chapters trace the subsequent story, from Euler's contributions to such wide-ranging topics as partitions, polyhedra, and latin squares to the 20th century advances in combinatorial set theory, enumeration, and graph theory. The book concludes with some combinatorial reflections by the distinguished combinatorialist, Peter J. Cameron. This book is not expected to be read from cover to cover, although it can be. Rather, it aims to serve as a valuable resource to a variety of audiences. Combinatorialists with little or no knowledge about the development of their subject will find the historical treatment stimulating. A historian of mathematics will view its assorted surveys as an encouragement for further research in combinatorics. The more general reader will discover an introduction to a fascinating and too little known subject that continues to stimulate and inspire the work of scholars today.




Chemical Reaction Networks


Book Description

Over the last decade, increased attention to reaction dynamics, combined with the intensive application of computers in chemical studies, mathematical modeling of chemical processes, and mechanistic studies has brought graph theory to the forefront of research. It offers an advanced and powerful formalism for the description of chemical reactions and their intrinsic reaction mechanisms. Chemical Reaction Networks: A Graph-Theoretical Approach elegantly reviews and expands upon graph theory as applied to mechanistic theory, chemical kinetics, and catalysis. The authors explore various graph-theoretical approaches to canonical representation, numbering, and coding of elementary steps and chemical reaction mechanisms, the analysis of their topological structure, the complexity estimation, and classification of reaction mechanisms. They discuss topologically distinctive features of multiroute catalytic and noncatalytic and chain reactions involving metal complexes. With it's careful balance of clear language and mathematical rigor, the presentation of the authors' significant original work, and emphasis on practical applications and examples, Chemical Reaction Networks: A Graph Theoretical Approach is both an outstanding reference and valuable tool for chemical research.




Quantitative Graph Theory


Book Description

The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as: Comparative approaches (graph similarity or distance) Graph measures to characterize graphs quantitatively Applications of graph measures in social network analysis and other disciplines Metrical properties of graphs and measures Mathematical properties of quantitative methods or measures in graph theory Network complexity measures and other topological indices Quantitative approaches to graphs using machine learning (e.g., clustering) Graph measures and statistics Information-theoretic methods to analyze graphs quantitatively (e.g., entropy) Through its broad coverage, Quantitative Graph Theory: Mathematical Foundations and Applications fills a gap in the contemporary literature of discrete and applied mathematics, computer science, systems biology, and related disciplines. It is intended for researchers as well as graduate and advanced undergraduate students in the fields of mathematics, computer science, mathematical chemistry, cheminformatics, physics, bioinformatics, and systems biology.




Symmetry and Combinatorial Enumeration in Chemistry


Book Description

This book is written to introduce a new approach to stereochemical problems and to combinatorial enumerations in chemistry. This approach is based on group the ory, but different from conventional ways adopted by most textbooks on chemical group theory. The difference sterns from their starting points: conjugate subgroups and conjugacy classes. The conventional textbooks deal with linear representations and character ta bles of point groups. This fact implies that they lay stress on conjugacy classesj in fact, such group characters are determined for the respective conjugacy classes. This approach is versatile, since conjugacy classes can be easily obtained by ex amining every element of a group. It is unnecessary to know the group-subgroup relationship of the group, which is not always easy to obtain. The same situa tion is true for chemical enumerations, though these are founded on permutation groups. Thus, the P6lya-Redfield theorem (1935 and 1927) uses a cycle index that is composed of terms associated with conjugacy classes.