Bücher der Reihe Encyclopedia of Mathematics and its Applications

This unique book develops the classical subjects of geometric probability and integral geometry, and the more modern one of stochastic geometry, in rather a novel way to provide a unifying framework in which they can be studied. The author focuses on factorisation properties of measures and probabilities implied by the assumption of their invariance with respect to a group, in order to investigate non-trivial factors. The study of these properties is the central theme of the book. Basic facts about integral geometry and random point process theory are developed in a simple geometric way, so that the whole approach is suitable for a non-specialist audience. Even in the later chapters, where the factorisation principles are applied to geometrical processes, the prerequisites are only standard courses on probability and analysis. The main ideas presented here have application to such areas as stereology and tomography, geometrical statistics, pattern and texture analysis. This book will be well suited as a starting point for individuals working in those areas to learn about the mathematical framework. It will also prove valuable as an introduction to geometric probability theory and integral geometry based on modern ideas.

Current research on the spectral theory of finite graphs may be seen as part of a wider effort to forge closer links between algebra and combinatorics (in particular between linear algebra and graph theory).This book describes how this topic can be strengthened by exploiting properties of the eigenspaces of adjacency matrices associated with a graph. The extension of spectral techniques proceeds at three levels: using eigenvectors associated with an arbitrary labelling of graph vertices, using geometrical invariants of eigenspaces such as graph angles and main angles, and introducing certain kinds of canonical eigenvectors by means of star partitions and star bases. One objective is to describe graphs by algebraic means as far as possible, and the book discusses the Ulam reconstruction conjecture and the graph isomorphism problem in this context. Further problems of graph reconstruction and identification are used to illustrate the importance of graph angles and star partitions in relation to graph structure. Specialists in graph theory will welcome this treatment of important new research.

Oriented matroids are a very natural mathematical concept which presents itself in many different guises and which has connections and applications to many different areas. These include discrete and computational geometry, combinatorics, convexity, topology, algebraic geometry, operations research, computer science and theoretical chemistry. This is the second edition of the first comprehensive, accessible account of the subject. It is intended for a diverse audience: graduate students who wish to learn the subject from scratch; researchers in the various fields of application who want to concentrate on certain aspects of the theory; specialists who need a thorough reference work; and others at academic points in between. A list of exercises and open problems ends each chapter. For the second edition, the authors have expanded the bibliography greatly to ensure that it remains comprehensive and up-to-date, and they have also added an appendix surveying research since the work was first published.

Dynamic data assimilation is the assessment, combination and synthesis of observational data, scientific laws and mathematical models to determine the state of a complex physical system, for instance as a preliminary step in making predictions about the system's behaviour. The topic has assumed increasing importance in fields such as numerical weather prediction where conscientious efforts are being made to extend the term of reliable weather forecasts beyond the few days that are presently feasible. This book is designed to be a basic one-stop reference for graduate students and researchers. It is based on graduate courses taught over a decade to mathematicians, scientists, and engineers, and its modular structure accommodates the various audience requirements. Thus Part I is a broad introduction to the history, development and philosophy of data assimilation, illustrated by examples; Part II considers the classical, static approaches, both linear and nonlinear; and Part III describes computational techniques. Parts IV to VII are concerned with how statistical and dynamic ideas can be incorporated into the classical framework. Key themes covered here include estimation theory, stochastic and dynamic models, and sequential filtering. The final part addresses the predictability of dynamical systems. Chapters end with a section that provides pointers to the literature, and a set of exercises with instructive hints.

Polycycles and symmetric polyhedra appear as generalisations of graphs in the modelling of molecular structures, such as the Nobel prize winning fullerenes, occurring in chemistry and crystallography. The chemistry has inspired and informed many interesting questions in mathematics and computer science, which in turn have suggested directions for synthesis of molecules. Here the authors give access to new results in the theory of polycycles and two-faced maps together with the relevant background material and mathematical tools for their study. Organised so that, after reading the introductory chapter, each chapter can be read independently from the others, the book should be accessible to researchers and students in graph theory, discrete geometry, and combinatorics, as well as to those in more applied areas such as mathematical chemistry and crystallography. Many of the results in the subject require the use of computer enumeration; the corresponding programs are available from the author's website.

Traditional game theory has been successful at developing strategy in games of incomplete information: when one player knows something that the other does not. But it has little to say about games of complete information, for example, tic-tac-toe, solitaire and hex. The main challenge of combinatorial game theory is to handle combinatorial chaos, where brute force study is impractical. In this comprehensive volume, Jozsef Beck shows readers how to escape from the combinatorial chaos via the fake probabilistic method, a game-theoretic adaptation of the probabilistic method in combinatorics. Using this, the author is able to determine the exact results about infinite classes of many games, leading to the discovery of some striking new duality principles. Available for the first time in paperback, it includes a new appendix to address the results that have appeared since the book's original publication.

This revised and expanded new edition will continue to meet the needs for an authoritative, up-to-date, self contained, and comprehensive account of the rapidly growing field of basic hypergeometric series, or q-series. Simplicity, clarity, deductive proofs, thoughtfully designed exercises, and useful appendices are among its strengths. The first five chapters cover basic hypergeometric series and integrals, whilst the next five are devoted to applications in various areas including Askey-Wilson integrals and orthogonal polynomials, partitions in number theory, multiple series, orthogonal polynomials in several variables, and generating functions. Chapters 9-11 are new for the second edition, the final chapter containing a simplified version of the main elements of the theta and elliptic hypergeometric series as a natural extension of the single-base q-series. Some sections and exercises have been added to reflect recent developments, and the Bibliography has been revised to maintain its comprehensiveness.

The Hilbert transform has many uses, including solving problems in aerodynamics, condensed matter physics, optics, fluids, and engineering. Written in a style that will suit a wide audience (including the physical sciences), this book will become the reference of choice on the topic, whatever the subject background of the reader. It explains all the common Hilbert transforms, mathematical techniques for evaluating them, and has detailed discussions of their application. Especially useful for researchers are the tabulation of analytically evaluated Hilbert transforms, and an atlas that immediately illustrates how the Hilbert transform alters a function. A collection of exercises helps the reader to test their understanding of the material in each chapter. The bibliography is a wide-ranging collection of references both to the classical mathematical papers, and to a diverse array of applications.

Originally published in 1996, this is a presentation of some complex problems of discrete mathematics in a simple and unified form using an original, general combinatorial scheme. The author's aim is not always to present the most general results, but rather to focus attention on ones that illustrate the methods described. A distinctive aspect of the book is the large number of asymptotic formulae derived. Professor Sachkov begins with a discussion of block designs and Latin squares before proceeding to treat transversals, devoting much attention to enumerative problems. The main role in these problems is played by generating functions, which are considered in Chapter 3. The general combinatorial scheme is then introduced and in the last chapter Polya's enumerative theory is discussed. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate.

This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilistic setting of Sachkov's general combinatorial scheme. The author pays special attention to using probabilistic methods to obtain asymptotic formulae that are difficult to derive using combinatorial methods. This was an important book, describing many ideas not previously available in English; the author has taken the chance to rewrite parts of the text and refresh the references where appropriate.

This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and complexity theory and lists a number of intriguing open problems. An introduction to the basics of logic and complexity theory is followed by discussion of important results in propositional proof systems and systems of bounded arithmetic. More advanced topics are then treated, including polynomial simulations and conservativity results, various witnessing theorems, the translation of bounded formulas (and their proofs) into propositional ones, the method of random partial restrictions and its applications, direct independence proofs, complete systems of partial relations, lower bounds to the size of constant-depth propositional proofs, the method of Boolean valuations, the issue of hard tautologies and optimal proof systems, combinatorics and complexity theory within bounded arithmetic, and relations to complexity issues of predicate calculus. Students and researchers in mathematical logic and complexity theory will find this comprehensive treatment an excellent guide to this expanding interdisciplinary area.

Now in paperback, this classic book is addressed to all lovers of number theory. On the one hand, it gives a comprehensive introduction to constructive algebraic number theory, and is therefore especially suited as a textbook for a course on that subject. On the other hand many parts go beyond an introduction and make the user familiar with recent research in the field. New methods which have been developed for experimental number theoreticians are included along with new and important results. Both computer scientists interested in higher arithmetic and those teaching algebraic number theory will find the book of value.

The Hilbert transform has many uses, including solving problems in aerodynamics, condensed matter physics, optics, fluids, and engineering. Written in a style that will suit a wide audience (including the physical sciences), this book will become the reference of choice on the topic, whatever the subject background of the reader. It explains all the common Hilbert transforms, mathematical techniques for evaluating them, and has detailed discussions of their application. Especially useful for researchers are the tabulation of analytically evaluated Hilbert transforms, and an atlas that immediately illustrates how the Hilbert transform alters a function. A collection of exercises helps the reader to test their understanding of the material in each chapter. The bibliography is a wide-ranging collection of references both to the classical mathematical papers, and to a diverse array of applications.

Orthonormal Systems and Banach Space Geometry describes the interplay between orthonormal expansions and Banach space geometry. Using harmonic analysis as a starting platform, classical inequalities and special functions are used to study orthonormal systems leading to an understanding of the advantages of systems consisting of characters on compact Abelian groups. Probabilistic concepts such as random variables and martingales are employed and Ramsey's theorem is used to study the theory of super-reflexivity. The text yields a detailed insight into concepts including type and co-type of Banach spaces, B-convexity, super-reflexivity, the vector-valued Fourier transform, the vector-valued Hilbert transform and the unconditionality property for martingale differences (UMD). A long list of unsolved problems is included as a starting point for research. This book should be accessible to graduate students and researchers with some basic knowledge of Banach space theory, real analysis, probability and algebra.

In Semimodular Lattices: Theory and Applications Manfred Stern uses successive generalizations of distributive and modular lattices to outline the development of semimodular lattices from Boolean algebras. He focuses on the important theory of semimodularity, its many ramifications, and its applications in discrete mathematics, combinatorics, and algebra. The book surveys and analyzes Garrett Birkhoff's concept of semimodularity and the various related concepts in lattice theory, and it presents theoretical results as well as applications in discrete mathematics group theory and universal algebra. The author also deals with lattices that are 'close' to semimodularity or can be combined with semimodularity, e.g. supersolvable, admissible, consistent, strong, and balanced lattices. Researchers in lattice theory, discrete mathematics, combinatorics, and algebra will find this book invaluable.

The theory of finite fields is a branch of algebra that has come to the fore because of its diverse applications in such areas as combinatorics, coding theory and the mathematical study of switching ciruits. This book is devoted entirely to the theory of finite fields, and it provides comprehensive coverage of the literature. Bibliographical notes at the end of each chapter give an historical survey of the development of the subject. Worked-out examples and lists of exercises found throughout the book make it useful as a text for advanced-level courses.

This volume deals with the Cauchy or initial value problem for linear differential equations. It treats in detail some of the applications of linear space methods to partial differential equations, especially the equations of mathematical physics such as the Maxwell, Schrodinger and Dirac equations. Background material presented in the first chapter makes the book accessible to mathematicians and physicists who are not specialists in this area as well as to graduate students.

This book focuses on the asymptotic behaviour of the probabilities of large deviations of the trajectories of random walks with 'heavy-tailed' (in particular, regularly varying, sub- and semiexponential) jump distributions. Large deviation probabilities are of great interest in numerous applied areas, typical examples being ruin probabilities in risk theory, error probabilities in mathematical statistics, and buffer-overflow probabilities in queueing theory. The classical large deviation theory, developed for distributions decaying exponentially fast (or even faster) at infinity, mostly uses analytical methods. If the fast decay condition fails, which is the case in many important applied problems, then direct probabilistic methods usually prove to be efficient. This monograph presents a unified and systematic exposition of the large deviation theory for heavy-tailed random walks. Most of the results presented in the book are appearing in a monograph for the first time. Many of them were obtained by the authors.

A series of important applications of combinatorics on words has emerged with the development of computerized text and string processing. The aim of this volume, the third in a trilogy, is to present a unified treatment of some of the major fields of applications. After an introduction that sets the scene and gathers together the basic facts, there follow chapters in which applications are considered in detail. The areas covered include core algorithms for text processing, natural language processing, speech processing, bioinformatics, and areas of applied mathematics such as combinatorial enumeration and fractal analysis. No special prerequisites are needed, and no familiarity with the application areas or with the material covered by the previous volumes is required. The breadth of application, combined with the inclusion of problems and algorithms and a complete bibliography will make this book ideal for graduate students and professionals in mathematics, computer science, biology and linguistics.

Simplex geometry is a topic generalizing geometry of the triangle and tetrahedron. The appropriate tool for its study is matrix theory, but applications usually involve solving huge systems of linear equations or eigenvalue problems, and geometry can help in visualizing the behaviour of the problem. In many cases, solving such systems may depend more on the distribution of non-zero coefficients than on their values, so graph theory is also useful. The author has discovered a method that in many (symmetric) cases helps to split huge systems into smaller parts. Many readers will welcome this book, from undergraduates to specialists in mathematics, as well as non-specialists who only use mathematics occasionally, and anyone who enjoys geometric theorems. It acquaints the reader with basic matrix theory, graph theory and elementary Euclidean geometry so that they too can appreciate the underlying connections between these various areas of mathematics and computer science.

Originally published in 1987, this book is devoted to the approximation of real functions by real rational functions. These are, in many ways, a more convenient tool than polynomials, and interest in them was growing, especially since D. Newman's work in the mid-sixties. The authors aim at presenting the basic achievements of the subject and, for completeness, also discuss some topics from complex rational approximation. Certain classical and modern results from linear approximation theory and spline approximation are also included for comparative purposes. This book will be of value to anyone with an interest in approximation theory and numerical analysis.

Originally published in 1981, this excellent treatment of the mathematical theory of entropy gives an accessible exposition of the ways in which this idea has been applied to information theory, ergodic theory, topological dynamics and statistical mechanics. Scientists who want a quick understanding of how entropy is applied in disciplines not their own, or simply desire a better understanding of the mathematical foundation of the entropy function will find this to be a valuable book.

Originally published in 1979, this book shows the beautiful simplifications that can be brought to the theory of differential equations by treating such equations from the product integral viewpoint. The first chapter of the book, dealing with linear ordinary differential equations, should be accessible to anyone with a knowledge of matrix theory and elementary calculus. Later chapters assume more sophistication on the part of the reader. The essential unity of these subjects is illustrated by the fact that the idea of the product integral can be naturally and effectively used to deal with all of them.

First published by Cambridge University Press in 1985, this series of Encyclopedia volumes attempts to present the factual body of all mathematics. Clarity of exposition and accessibility to the non-specialist were an important consideration in its design and language. The development of the algebraic aspects of angular momentum theory and the relationship between angular momentum theory and special topics in physics and mathematics are covered in this volume.

Originally published in 1984, the principal objective of this book is to make the general theory of field extensions accessible to any reader with a modest background in groups, rings and vector spaces. Galois theory is generally regarded as one of the central and most beautiful parts of algebra and its creation marked the culmination of investigations by generations of mathematicians on one of the oldest problems in algebra, the solvability of polynomial equations by radicals.

Originally published in 1981, this book forms volume 15 of the Encyclopedia of Mathematics and its Applications. The text provides a clear and thorough treatment of its subject, adhering to a clean exposition of the mathematical content of serious formulations of rational physical alternatives of quantum theory as elaborated in the influential works of the period, to which the authors made a significant contribution. The treatment falls into three distinct, logical parts: in the first part, the modern version of accumulated wisdom is presented, avoiding as far as possible the traditional language of classical physics for its interpretational character; in the second part, the individual structural elements for the logical content of the theory are laid out; in part three, the results of section two are used to reconstruct the usual Hilbert space formulation of quantum mechanics in a novel way.

The purpose of this book, which was first published in 1978, is to give a complete account of the theory of permanents, their history and applications. This volume was the first complete account of the theory of permanents, covering virtually the whole of the subject, a feature that no simple survey of the theory of matrices can even attempt. The work also contains many results stated without formal proofs. This book can be used as a textbook at the advanced undergraduate or graduate level. The only prerequisites are a standard undergraduate course in the theory of matrices and a measure of mathematical maturity.

The algebraic theory of automata was created by Schutzenberger and Chomsky over 50 years ago and there has since been a great deal of development. Classical work on the theory to noncommutative power series has been augmented more recently to areas such as representation theory, combinatorial mathematics and theoretical computer science. This book presents to an audience of graduate students and researchers a modern account of the subject and its applications. The algebraic approach allows the theory to be developed in a general form of wide applicability. For example, number-theoretic results can now be more fully explored, in addition to applications in automata theory, codes and non-commutative algebra. Much material, for example, Schutzenberger's theorem on polynomially bounded rational series, appears here for the first time in book form. This is an excellent resource and reference for all those working in algebra, theoretical computer science and their areas of overlap.

This comprehensive introduction to the calculus of variations and its main principles also presents their real-life applications in various contexts: mathematical physics, differential geometry, and optimization in economics. Based on the authors' original work, it provides an overview of the field, with examples and exercises suitable for graduate students entering research. The method of presentation will appeal to readers with diverse backgrounds in functional analysis, differential geometry and partial differential equations. Each chapter includes detailed heuristic arguments, providing thorough motivation for the material developed later in the text. Since much of the material has a strong geometric flavor, the authors have supplemented the text with figures to illustrate the abstract concepts. Its extensive reference list and index also make this a valuable resource for researchers working in a variety of fields who are interested in partial differential equations and functional analysis.

In recent years the traditional subject of continuum mechanics has grown rapidly and many new techniques have emerged. This text provides a rigorous, yet accessible introduction to the basic concepts of the network approximation method and provides a unified approach for solving a wide variety of applied problems. As a unifying theme, the authors discuss in detail the transport problem in a system of bodies. They solve the problem of closely placed bodies using the new method of network approximation for PDE with discontinuous coefficients, developed in the 2000s by applied mathematicians in the USA and Russia. Intended for graduate students in applied mathematics and related fields such as physics, chemistry and engineering, the book is also a useful overview of the topic for researchers in these areas.