Instructor's Manual with Selected Solutions for "Applied Combinatorics", Second Edition
by Alan Tucker
Volume Inequalities for Arrangements of Convex Bodies (Discrete Mathematics and Its Applications)
by Karoly Bezdek and Muhammad Ali Khan
The book is centered around two major conjectures of discrete geometry: the Hadwiger-Levi conjecture (1955) and the Kneser-Poulsen conjecture (1955). Although both conjectures have been solved only in dimension two and are open in higher dimensions, they have already influenced a great deal of research in discrete geometry and surely will continue to do so. The book gives a detailed account of all major results already achieved with complete proofs and emphasizing the role of volumetric methods/...
Capacitated Planned Maintenance (Lecture Notes in Economics and Mathematical Systems, #686)
by Torben Kuschel
This book examines the problem of maintenance planning and scheduling in industrial production systems. It presents two practically relevant, deterministic mathematical models: the capacitated planned maintenance problem (CPMP) and the weighted uncapacitated planned maintenance problem (WUPMP). It introduces specific optimization algorithms such as construction heuristics, Lagrangean and tabu search metaheuristics. A problem independent hybrid approach links and alternates between two Lagrangean...
Nonnegative matrix factorization (NMF) in its modern form has become a standard tool in the analysis of high-dimensional data sets. This book provides a comprehensive and up-to-date account of the most important aspects of the NMF problem and is the first to detail its theoretical aspects, including geometric interpretation, nonnegative rank, complexity, and uniqueness. It explains why understanding these theoretical insights is key to using this computational tool effectively and meaningfully....
Sheaf theory provides a means of discussing many different kinds of geometric objects in respect of the connection between their local and global properties. It finds its main applications in topology and modern algebraic geometry where it has been used as a tool for solving, with great success, several long-standing problems. This text is based on a lecture course for graduate pure mathematicians which builds up enough of the foundations of sheaf theory to give a broad definition of manifold, c...
Graphs on Surfaces and Their Applications (Encyclopaedia of Mathematical Sciences, #141)
by Sergei K. Lando and Alexander K. Zvonkin
Graphs drawn on two-dimensional surfaces have always attracted researchers by their beauty and by the variety of difficult questions to which they give rise. The theory of such embedded graphs, which long seemed rather isolated, has witnessed the appearance of entirely unexpected new applications in recent decades, ranging from Galois theory to quantum gravity models, and has become a kind of a focus of a vast field of research. The book provides an accessible introduction to this new domain, in...
Computational Discrete Mathematics (Lecture Notes in Computer Science, #2122)
This book is based on a graduate education program on computational discrete mathematics run for several years in Berlin, Germany, as a joint effort of theoretical computer scientists and mathematicians in order to support doctoral students and advanced ongoing education in the field of discrete mathematics and algorithmics. The 12 selected lectures by leading researchers presented in this book provide recent research results and advanced topics in a coherent and consolidated way. Among the area...
Models of Network Reliability
by Ilya B Gertsbakh, Yoseph Shpungin, and I.B. Gertsbakh
Unique in its approach, Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo provides a brief introduction to Monte Carlo methods along with a concise exposition of reliability theory ideas. From there, the text investigates a collection of principal network reliability models, such as terminal connectivity for networks with unreliable edges and/or nodes, network lifetime distribution in the process of its destruction, network stationary behavior for renewable components, impo...
Dieses Lehrbuch vermittelt die Grundlagen und Konzepte der modernen Kombinatorik in anschaulicher Weise. Die verstandliche Darlegung richtet sich an Studierende der Mathematik, der Naturwissenschaften, der Informatik und der Wirtschaftswissenschaften und erlaubt einen einfachen und beispielorientierten Zugang zu den Methoden der Kombinatorik. Beginnend mit den Grundaufgaben der Kombinatorik wird der Leser Schritt fur Schritt mit weiterfuhrenden Themen wie erzeugende Funktionen, Rekurrenzgleichun...
Big Data of Complex Networks (Chapman & Hall/CRC Big Data)
Big Data of Complex Networks presents and explains the methods from the study of big data that can be used in analysing massive structural data sets, including both very large networks and sets of graphs. As well as applying statistical analysis techniques like sampling and bootstrapping in an interdisciplinary manner to produce novel techniques for analyzing massive amounts of data, this book also explores the possibilities offered by the special aspects such as computer memory in investigating...
Fundamentals of Computation Theory (Lecture Notes in Computer Science, #965)
This book presents the proceedings of the 10th International Conference on Fundamentals of Computation Theory, FCT '95, held in Dresden, Germany in August 1995. The volume contains five invited lectures and 32 revised papers carefully selected for presentation at FCT '95. A broad spectrum of theoretical computer science is covered; among topics addressed are algorithms and data structures, automata and formal languages, categories and types, computability and complexity, computational logics, co...
Evolution and Biocomputation (Lecture Notes in Computer Science, #899)
This volume comprises ten thoroughly refereed and revised full papers originating from an interdisciplinary workshop on biocomputation entitled "Evolution as a Computational Process", held in Monterey, California in July 1992. This book is devoted to viewing biological evolution as a giant computational process being carried out over a vast spatial and temporal scale. Computer scientists, mathematicians and physicists may learn about optimization from looking at natural evolution and biologists...
One of the most successful methods for discovering the way mental processes are organized is to observe the effects in experiments of selectively influencing the processes. Selective influence is crucial in techniques such as Sternberg's additive factor method for reaction times and Jacoby's process dissociation procedure for accuracy. The successful uses of selective influence have encouraged application extensions to complex architectures, to dependent variables such as evoked potentials, and...
Lecture Notes in Quantum Chemistry II (Lecture Notes in Chemistry, #64)
The first volume of Lecture Notes in Quantum Chemistry (Lecture Notes in Chemistry 58, Springer Verlag, Berlin 1992) contained a compilation of selected lectures given at the two first European Summer Schools in Quantum Chemistry (ESQC), held in southern Sweden in August 1989 and 1991, respectively. The notes were written by the teachers at the school and covered a large range of topics in ab initio quantum chemistry. After the third summer school (held in 1993) it was decided to put together a...
Combinatorics of Train Tracks. (AM-125), Volume 125 (Annals of Mathematics Studies)
by R. C. Penner and John L. Harer
Measured geodesic laminations are a natural generalization of simple closed curves in surfaces, and they play a decisive role in various developments in two-and three-dimensional topology, geometry, and dynamical systems. This book presents a self-contained and comprehensive treatment of the rich combinatorial structure of the space of measured geodesic laminations in a fixed surface. Families of measured geodesic laminations are described by specifying a train track in the surface, and the spac...
STACS 92 (Lecture Notes in Computer Science, #577)
This volume gives the proceedings of the ninth Symposium on Theoretical Aspects of Computer Science (STACS). This annual symposium is held alternately in France and Germany and is organized jointly by the Special Interest Group for Fundamental Computer Science of the Association Francaise des Sciences et Technologies de l'Information et des Syst mes (AFCET) and the Special Interest Group for Theoretical Computer Science of the Gesellschaft f}r Informatik (GI). The volume...
Combinatorial Algebraic Topology (Algorithms and Computation in Mathematics, #21)
by Dimitry Kozlov
This volume is the first comprehensive treatment of combinatorial algebraic topology in book form. The first part of the book constitutes a swift walk through the main tools of algebraic topology. Readers - graduate students and working mathematicians alike - will probably find particularly useful the second part, which contains an in-depth discussion of the major research techniques of combinatorial algebraic topology. Although applications are sprinkled throughout the second part, they are pri...
The study of matroids is a branch of discrete mathematics with basic links to graphs, lattices, codes, transversals, and projective geometries. Matroids are of fundamental importance in combinatorial optimization and their applications extend into electrical engineering and statics. This new in paperback version of the classic "Matroid Theory" by James Oxley provides a comprehensive introduction to matroid theory, covering the very basics to more advanced topics. With over 500 exercises and pro...
Group actions on trees furnish a unified geometric way of recasting the chapter of combinatorial group theory dealing with free groups, amalgams, and HNN extensions. Some of the principal examples arise from rank one simple Lie groups over a non-archimidean local field acting on their Bruhat-Tits trees. In particular this leads to a powerful method for studying lattices in such Lie groups.
Putnam and Beyond (Lecture Notes in Earth Sciences, #341)
by Razvan Gelca and Titu Andreescu
Putnam and Beyond takes the reader on a journey through the world of college mathematics, focusing on some of the most important concepts and results in the theories of polynomials, linear algebra, real analysis in one and several variables, differential equations, coordinate geometry, trigonometry, elementary number theory, combinatorics, and probability. Using the W.L. Putnam Mathematical Competition for undergraduates as an inspiring symbol to build an appropriate math background for graduate...