Author: Fred Roberts
Publisher: CRC Press
Release Date: 2009-06-03
Now with solutions to selected problems, Applied Combinatorics, Second Edition presents the tools of combinatorics from an applied point of view. This bestselling textbook offers numerous references to the literature of combinatorics and its applications that enable readers to delve more deeply into the topics. After introducing fundamental counting rules and the tools of graph theory and relations, the authors focus on three basic problems of combinatorics: counting, existence, and optimization problems. They discuss advanced tools for dealing with the counting problem, including generating functions, recurrences, inclusion/exclusion, and Pólya theory. The text then covers combinatorial design, coding theory, and special problems in graph theory. It also illustrates the basic ideas of combinatorial optimization through a study of graphs and networks.
Author: Sergei K. Lando
Publisher: American Mathematical Soc.
Release Date: 2003-10-21
In combinatorics, one often considers the process of enumerating objects of a certain nature, which results in a sequence of positive integers. With each such sequence, one can associate a generating function, whose properties tell us a lot about the nature of the objects being enumerated. Nowadays, the language of generating functions is the main language of enumerative combinatorics. This book is based on the course given by the author at the College of Mathematics of the Independent University of Moscow. It starts with definitions, simple properties, and numerous examples of generating functions. It then discusses various topics, such as formal grammars, generating functions in several variables, partitions and decompositions, and the exclusion-inclusion principle. In the final chapter, the author describes applications of generating functions to enumeration of trees, plane graphs, and graphs embedded in two-dimensional surfaces. Throughout the book, the reader is motivated by interesting examples rather than by general theories. It also contains a lot of exercises to help the reader master the material. Little beyond the standard calculus course is necessary to understand the book. It can serve as a text for a one-semester undergraduate course in combinatorics.
Author: Philippe Flajolet
Publisher: Cambridge University Press
Release Date: 2009-01-15
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.
Two major subjects are treated in this book. The main one is the theory of Bernoulli numbers and the other is the theory of zeta functions. Historically, Bernoulli numbers were introduced to give formulas for the sums of powers of consecutive integers. The real reason that they are indispensable for number theory, however, lies in the fact that special values of the Riemann zeta function can be written by using Bernoulli numbers. This leads to more advanced topics, a number of which are treated in this book: Historical remarks on Bernoulli numbers and the formula for the sum of powers of consecutive integers; a formula for Bernoulli numbers by Stirling numbers; the Clausen–von Staudt theorem on the denominators of Bernoulli numbers; Kummer's congruence between Bernoulli numbers and a related theory of p-adic measures; the Euler–Maclaurin summation formula; the functional equation of the Riemann zeta function and the Dirichlet L functions, and their special values at suitable integers; various formulas of exponential sums expressed by generalized Bernoulli numbers; the relation between ideal classes of orders of quadratic fields and equivalence classes of binary quadratic forms; class number formula for positive definite binary quadratic forms; congruences between some class numbers and Bernoulli numbers; simple zeta functions of prehomogeneous vector spaces; Hurwitz numbers; Barnes multiple zeta functions and their special values; the functional equation of the doub le zeta functions; and poly-Bernoulli numbers. An appendix by Don Zagier on curious and exotic identities for Bernoulli numbers is also supplied. This book will be enjoyable both for amateurs and for professional researchers. Because the logical relations between the chapters are loosely connected, readers can start with any chapter depending on their interests. The expositions of the topics are not always typical, and some parts are completely new.
Author: Pavel L. Krapivsky
Publisher: Cambridge University Press
Release Date: 2010-11-18
Aimed at graduate students, this book explores some of the core phenomena in non-equilibrium statistical physics. It focuses on the development and application of theoretical methods to help students develop their problem-solving skills. The book begins with microscopic transport processes: diffusion, collision-driven phenomena, and exclusion. It then presents the kinetics of aggregation, fragmentation and adsorption, where the basic phenomenology and solution techniques are emphasized. The following chapters cover kinetic spin systems, both from a discrete and a continuum perspective, the role of disorder in non-equilibrium processes, hysteresis from the non-equilibrium perspective, the kinetics of chemical reactions, and the properties of complex networks. The book contains 200 exercises to test students' understanding of the subject. A link to a website hosted by the authors, containing supplementary material including solutions to some of the exercises, can be found at www.cambridge.org/9780521851039.
Author: Michael Grinfeld
Publisher: John Wiley & Sons
Release Date: 2014-11-05
The new edition is significantly updated and expanded. This unique collection of review articles, ranging from fundamental concepts up to latest applications, contains individual contributions written by renowned experts in the relevant fields. Much attention is paid to ensuring fast access to the information, with each carefully reviewed article featuring cross-referencing, references to the most relevant publications in the field, and suggestions for further reading, both introductory as well as more specialized. While the chapters on group theory, integral transforms, Monte Carlo methods, numerical analysis, perturbation theory, and special functions are thoroughly rewritten, completely new content includes sections on commutative algebra, computational algebraic topology, differential geometry, dynamical systems, functional analysis, graph and network theory, PDEs of mathematical physics, probability theory, stochastic differential equations, and variational methods.
Release Date: 2004
Genre: American literature
Books in print is the major source of information on books currently published and in print in the United States. The database provides the record of forthcoming books, books in-print, and books out-of-print.
Dieses Buch ist eine Einführung in die Differentialgeometrie. Zunächst geht es um die klassischen Aspekte wie die Geometrie von Kurven und Flächen, bevor dann höherdimensionale Flächen sowie abstrakte Mannigfaltigkeiten betrachtet werden. Die Nahtstelle ist dabei das zentrale Kapitel "Die innere Geometrie von Flächen". Dieses führt den Leser bis hin zu dem berühmten Satz von Gauß-Bonnet, der ein entscheidendes Bindeglied zwischen lokaler und globaler Geometrie darstellt. Die zweite Hälfte des Buches ist der Riemannschen Geometrie gewidmet. Den Abschluss bildet ein Kapitel über "Einstein-Räume", die eine große Bedeutung sowohl in der "Reinen Mathematik" als auch in der Allgemeinen Relativitätstheorie von A. Einstein haben. Es wird großer Wert auf Anschaulichkeit gelegt, was durch zahlreiche Abbildungen unterstützt wird. Im Laufe der Neuauflagen wurde der Text erweitert, neue Aufgaben wurden hinzugefügt und am Ende des Buches wurden zusätzliche Hinweise zur Lösung der Übungsaufgaben ergänzt. Der Text wurde für die fünfte Auflage gründlich durchgesehen und an einigen Stellen verbessert.
Neben den elementaren Dingen, wie Tangenten, Singularitäten und Wendepunkten werden auch schwierigere Begriffe wie lokale Zweige und Geschlecht behandelt. Höhepunkte sind die klassischen Formeln von Plücker und Clebsch, die Beziehungen zwischen verschiedenen globalen und lokalen Invarianten einer Kurve beschreiben.