Algebraic Combinatorics and the Monster Group


Book Description

The current state of knowledge on the Monster group, including Majorana theory, Vertex Operator Algebras, Moonshine and maximal subgroups.







数理科学講究錄


Book Description




An Invitation to Computational Homotopy


Book Description

An Invitation to Computational Homotopy is an introduction to elementary algebraic topology for those with an interest in computers and computer programming. It expertly illustrates how the basics of the subject can be implemented on a computer through its focus on fully-worked examples designed to develop problem solving techniques. The transition from basic theory to practical computation raises a range of non-trivial algorithmic issues which will appeal to readers already familiar with basic theory and who are interested in developing computational aspects. The book covers a subset of standard introductory material on fundamental groups, covering spaces, homology, cohomology and classifying spaces as well as some less standard material on crossed modules. These topics are covered in a way that hints at potential applications of topology in areas of computer science and engineering outside the usual territory of pure mathematics, and also in a way that demonstrates how computers can be used to perform explicit calculations within the domain of pure algebraic topology itself. The initial chapters include in-depth examples from data mining, biology and digital image analysis, while the later chapters cover a range of computational examples on the cohomology of classifying spaces that are likely beyond the reach of a purely paper-and-pen approach to the subject. An Invitation to Computational Homotopy serves as a self-contained and informal introduction to these topics and their implementation in the sphere of computer science. Written in a dynamic and engaging style, it skilfully showcases a range of useful machine computations, and will serve as an invaluable aid to graduate students working with algebraic topology.







Algebraic Graph Theory


Book Description

This is a substantial revision of a much-quoted monograph, first published in 1974. The structure is unchanged, but the text has been clarified and the notation brought into line with current practice. A large number of 'Additional Results' are included at the end of each chapter, thereby covering most of the major advances in the last twenty years. Professor Biggs' basic aim remains to express properties of graphs in algebraic terms, then to deduce theorems about them. In the first part, he tackles the applications of linear algebra and matrix theory to the study of graphs; algebraic constructions such as adjacency matrix and the incidence matrix and their applications are discussed in depth. There follows an extensive account of the theory of chromatic polynomials, a subject which has strong links with the 'interaction models' studied in theoretical physics, and the theory of knots. The last part deals with symmetry and regularity properties. Here there are important connections with other branches of algebraic combinatorics and group theory. This new and enlarged edition this will be essential reading for a wide range of mathematicians, computer scientists and theoretical physicists.




Mathematical Reviews


Book Description




Categorical Homotopy Theory


Book Description

This book develops abstract homotopy theory from the categorical perspective with a particular focus on examples. Part I discusses two competing perspectives by which one typically first encounters homotopy (co)limits: either as derived functors definable when the appropriate diagram categories admit a compatible model structure, or through particular formulae that give the right notion in certain examples. Emily Riehl unifies these seemingly rival perspectives and demonstrates that model structures on diagram categories are irrelevant. Homotopy (co)limits are explained to be a special case of weighted (co)limits, a foundational topic in enriched category theory. In Part II, Riehl further examines this topic, separating categorical arguments from homotopical ones. Part III treats the most ubiquitous axiomatic framework for homotopy theory - Quillen's model categories. Here, Riehl simplifies familiar model categorical lemmas and definitions by focusing on weak factorization systems. Part IV introduces quasi-categories and homotopy coherence.




Integer Programming and Related Areas


Book Description

The fields of integer programming and combinatorial optimization continue to be areas of great vitality, with an ever increasing number of publications and journals appearing. A classified bibliography thus continues to be necessary and useful today, even more so than it did when the project, of which this is the fifth volume, was started in 1970 in the Institut fur Okonometrie und Operations Research of the University of Bonn. The pioneering first volume was compiled by Claus Kastning during the years 1970 - 1975 and appeared in 1976 as Volume 128 of the series Lecture Notes in Economics and Mathematical Systems published by the Springer Verlag. Work on the project was continued by Dirk Hausmann, Reinhardt Euler, and Rabe von Randow, and resulted in the publication of the second, third, and fourth volumes in 1978, 1982, and 1985 (Volumes 160, 197, and 243 of the above series). The present book constitutes the fifth volume of the bibliography and covers the period from autumn 1984 to the end of 1987. It contains 5864 new publications by 4480 authors and was compiled by Rabe von Randow. Its form is practically identical to that of the first four volumes, some additions having been made to the subject list.