Peter J. Cameron – författare

Enumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical mechanics. This book, which stems from many years' experience of teaching, invites students into the subject and prepares them for more advanced texts. It is suitable as a class text or for individual study. The author provides proofs for many of the theorems to show the range of techniques available, and uses examples to link enumerative combinatorics to other areas of study. The main section of the book introduces the key tools of the subject (generating functions and recurrence relations), which are then used to study the most important combinatorial objects, namely subsets, partitions, and permutations of a set. Later chapters deal with more specialised topics, including permanents, SDRs, group actions and the Redfield-Pólya theory of cycle indices, Möbius inversion, the Tutte polynomial, and species.

Developed to meet the needs of modern students, this Second Edition of the classic algebra text by Peter Cameron covers all the abstract algebra an undergraduate student is likely to need. Starting with an introductory overview of numbers, sets and functions, matrices, polynomials, and modular arithmetic, the text then introduces the most important algebraic structures: groups, rings and fields, and their properties. This is followed by coverage of vector spaces and modules with applications to abelian groups and canonical forms before returning to the construction of the number systems, including the existence of transcendental numbers. The final chapters take the reader further into the theory of groups, rings and fields, coding theory, and Galois theory. With over 300 exercises, and web-based solutions, this is an ideal introductory text for Year 1 and 2 undergraduate students in mathematics.

Developed to meet the needs of modern students, this Second Edition of the classic algebra text by Peter Cameron covers all the abstract algebra an undergraduate student is likely to need. Starting with an introductory overview of numbers, sets and functions, matrices, polynomials, and modular arithmetic, the text then introduces the most important algebraic structures: groups, rings and fields, and their properties. This is followed by coverage of vector spaces and modules with applications to abelian groups and canonical forms before returning to the construction of the number systems, including the existence of transcendental numbers. The final chapters take the reader further into the theory of groups, rings and fields, coding theory, and Galois theory. With over 300 exercises, and web-based solutions, this is an ideal introductory text for Year 1 and 2 undergraduate students in mathematics.

These notes present an investigation of a condition similar to Euclid's parallel axiom for subsets of finite sets. The background material to the theory of parallelisms is introduced and the author then describes the links this theory has with other topics from the whole range of combinatorial theory and permutation groups. These include network flows, perfect codes, Latin squares, block designs and multiply-transitive permutation groups, and long and detailed appendices are provided to serve as introductions to these various subjects. Many of the results are published for the first time.

The study of permutation groups has always been closely associated with that of highly symmetric structures. The objects considered here are countably infinite, but have only finitely many different substructures of any given finite size. They are precisely those structures which are determined by first-order logical axioms together with the assumption of countability. This book concerns such structures, their substructures and their automorphism groups. A wide range of techniques are used: group theory, combinatorics, Baire category and measure among them. The book arose from lectures given at a research symposium and retains their informal style, whilst including as well many recent results from a variety of sources. It concludes with exercises and unsolved research problems.

Combinatorics is a subject of increasing importance, owing to its links with computer science, statistics and algebra. This is a textbook aimed at second-year undergraduates to beginning graduates. It stresses common techniques (such as generating functions and recursive construction) which underlie the great variety of subject matter and also stresses the fact that a constructive or algorithmic proof is more valuable than an existence proof. The book is divided into two parts, the second at a higher level and with a wider range than the first. Historical notes are included which give a wider perspective on the subject. More advanced topics are given as projects and there are a number of exercises, some with solutions given.

Permutation groups are one of the oldest topics in algebra. However, their study has recently been revolutionised by new developments, particularly the classification of finite simple groups, but also relations with logic and combinatorics, and importantly, computer algebra systems have been introduced that can deal with large permutation groups. This book gives a summary of these developments, including an introduction to relevant computer algebra systems, sketch proofs of major theorems, and many examples of applying the classification of finite simple groups. It is aimed at beginning graduate students and experts in other areas, and grew from a short course at the EIDMA institute in Eindhoven.

Permutation groups are one of the oldest topics in algebra. However, their study has recently been revolutionised by new developments, particularly the classification of finite simple groups, but also relations with logic and combinatorics, and importantly, computer algebra systems have been introduced that can deal with large permutation groups. This book gives a summary of these developments, including an introduction to relevant computer algebra systems, sketch proofs of major theorems, and many examples of applying the classification of finite simple groups. It is aimed at beginning graduate students and experts in other areas, and grew from a short course at the EIDMA institute in Eindhoven.

The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explore various aspects of graph theory: linear algebra (for spectral theory) and group theory (for studying graph symmetry). These areas have links with other areas of mathematics, such as logic and harmonic analysis, and are increasingly being used in such areas as computer networks where symmetry is an important feature. Other books cover portions of this material, but this book is unusual in covering both of these aspects and there are no other books with such a wide scope. Peter J. Cameron, internationally recognized for his substantial contributions to the area, served as academic consultant for this volume, and the result is ten expository chapters written by acknowledged international experts in the field. Their well-written contributions have been carefully edited to enhance readability and to standardize the chapter structure, terminology and notation throughout the book. To help the reader, there is an extensive introductory chapter that covers the basic background material in graph theory, linear algebra and group theory. Each chapter concludes with an extensive list of references.

The ADE diagrams, shown on the cover, constitute one of the most universal and mysterious patterns in all of mathematics. John McKay's remarkable insights unveiled a connection between the 'double covers' of the groups of regular polyhedra, known since ancient Greek times, and the exceptional Lie algebras, recognised since the late nineteenth century. The correspondence involves the ADE diagrams being interpreted in different ways: as quivers associated with the groups and as Dynkin diagrams of root systems of Lie algebras. The ADE diagrams arise in many areas of mathematics, including topics in algebraic geometry, string theory, spectral theory of graphs and cluster algebras. Accessible to students, this book explains these connections with exercises and examples throughout. An excellent introduction for students and researchers wishing to learn more about this unifying principle of mathematics, it also presents standard undergraduate material from a novel perspective.

The ADE diagrams, shown on the cover, constitute one of the most universal and mysterious patterns in all of mathematics. John McKay's remarkable insights unveiled a connection between the 'double covers' of the groups of regular polyhedra, known since ancient Greek times, and the exceptional Lie algebras, recognised since the late nineteenth century. The correspondence involves the ADE diagrams being interpreted in different ways: as quivers associated with the groups and as Dynkin diagrams of root systems of Lie algebras. The ADE diagrams arise in many areas of mathematics, including topics in algebraic geometry, string theory, spectral theory of graphs and cluster algebras. Accessible to students, this book explains these connections with exercises and examples throughout. An excellent introduction for students and researchers wishing to learn more about this unifying principle of mathematics, it also presents standard undergraduate material from a novel perspective.

This collection of four short courses looks at group representations, graph spectra, statistical optimality, and symbolic dynamics, highlighting their common roots in linear algebra. It leads students from the very beginnings in linear algebra to high-level applications: representations of finite groups, leading to probability models and harmonic analysis; eigenvalues of growing graphs from quantum probability techniques; statistical optimality of designs from Laplacian eigenvalues of graphs; and symbolic dynamics, applying matrix stability and K-theory. An invaluable resource for researchers and beginning Ph.D. students, this book includes copious exercises, notes, and references.

The Shrikhande graph, discovered by Indian Mathematician Sharadchandra Shankar Shrikhande in 1959, exhibits several unusual properties and occupies a pivotal position within discrete mathematics. Offering a unique introduction to graph theory and discrete mathematics, this book uses the example of the Shrikhande graph as a window through which these topics can be explored. Providing historical background, including the Euler conjecture and its demise, the authors explore key concepts including: Cayley graphs; topological graph theory; spectral theory; Latin squares; root systems. A novel and valuable resource for graduate students and researchers interested in graph theory, its history, and applications, this book offers a comprehensive exploration of the Shrikhande graph and its significance.

The Shrikhande graph, discovered by Indian Mathematician Sharadchandra Shankar Shrikhande in 1959, exhibits several unusual properties and occupies a pivotal position within discrete mathematics. Offering a unique introduction to graph theory and discrete mathematics, this book uses the example of the Shrikhande graph as a window through which these topics can be explored. Providing historical background, including the Euler conjecture and its demise, the authors explore key concepts including: Cayley graphs; topological graph theory; spectral theory; Latin squares; root systems. A novel and valuable resource for graduate students and researchers interested in graph theory, its history, and applications, this book offers a comprehensive exploration of the Shrikhande graph and its significance.

Enumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical mechanics. This book, which stems from many years' experience of teaching, invites students into the subject and prepares them for more advanced texts. It is suitable as a class text or for individual study. The author provides proofs for many of the theorems to show the range of techniques available, and uses examples to link enumerative combinatorics to other areas of study. The main section of the book introduces the key tools of the subject (generating functions and recurrence relations), which are then used to study the most important combinatorial objects, namely subsets, partitions, and permutations of a set. Later chapters deal with more specialised topics, including permanents, SDRs, group actions and the Redfield-Pólya theory of cycle indices, Möbius inversion, the Tutte polynomial, and species.