Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Series
  3. Encyclopedia of Mathematics and its Applications

This series is devoted to significant topics or themes that have wide application in mathematics or mathematical science and for which a detailed development of the abstract theory is less important than a thorough and concrete exploration of the implications and applications. Books in The Encyclopedia of Mathematics and Its Applications cover their subject comprehensively. Less important results may be summarized as exercises at the ends of chapters. For technicalities, readers can be referred to the bibliography, which is expected to be comprehensive. As a result, volumes are encyclopedic references or manageable guides to major subjects.

  • Editorial Boards: R. Doran, M. Ismail, T.-Y. Lam, E. Lutwak

Refine search

Refine search

Content type:
Publication date:
Subject: Show more
Journals Show more
Publishers: Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

176 results in Encyclopedia of Mathematics and its Applications

Page 5 of 9

Codes and Automata
  • Jean Berstel, Dominique Perrin, Christophe Reutenauer
  • Published online:
    05 March 2013
    Print publication:
    05 November 2009
  • This major revision of Berstel and Perrin's classic Theory of Codes has been rewritten with a more modern focus and a much broader coverage of the subject. The concept of unambiguous automata, which is intimately linked with that of codes, now plays a significant role throughout the book, reflecting developments of the last 20 years. This is complemented by a discussion of the connection between codes and automata, and new material from the field of symbolic dynamics. The authors have also explored links with more practical applications, including data compression and cryptography. The treatment remains self-contained: there is background material on discrete mathematics, algebra and theoretical computer science. The wealth of exercises and examples make it ideal for self-study or courses. In sum this is a comprehensive reference on the theory of variable-length codes and their relation to automata.

Finite Precision Number Systems and Arithmetic
  • Peter Kornerup, David W. Matula
  • Published online:
    05 March 2013
    Print publication:
    30 September 2010
  • Fundamental arithmetic operations support virtually all of the engineering, scientific, and financial computations required for practical applications, from cryptography, to financial planning, to rocket science. This comprehensive reference provides researchers with the thorough understanding of number representations that is a necessary foundation for designing efficient arithmetic algorithms. Using the elementary foundations of radix number systems as a basis for arithmetic, the authors develop and compare alternative algorithms for the fundamental operations of addition, multiplication, division, and square root with precisely defined roundings. Various finite precision number systems are investigated, with the focus on comparative analysis of practically efficient algorithms for closed arithmetic operations over these systems. Each chapter begins with an introduction to its contents and ends with bibliographic notes and an extensive bibliography. The book may also be used for graduate teaching: problems and exercises are scattered throughout the text and a solutions manual is available for instructors.

Hadamard Expansions and Hyperasymptotic Evaluation
  • An Extension of the Method of Steepest Descents
  • R. B. Paris
  • Published online:
    05 March 2013
    Print publication:
    24 March 2011
  • The author describes the recently developed theory of Hadamard expansions applied to the high-precision (hyperasymptotic) evaluation of Laplace and Laplace-type integrals. This brand new method builds on the well-known asymptotic method of steepest descents, of which the opening chapter gives a detailed account illustrated by a series of examples of increasing complexity. A discussion of uniformity problems associated with various coalescence phenomena, the Stokes phenomenon and hyperasymptotics of Laplace-type integrals follows. The remaining chapters deal with the Hadamard expansion of Laplace integrals, with and without saddle points. Problems of different types of saddle coalescence are also discussed. The text is illustrated with many numerical examples, which help the reader to understand the level of accuracy achievable. The author also considers applications to some important special functions. This book is ideal for graduate students and researchers working in asymptotics.

Combinatorics, Automata and Number Theory
  • Edited by Valérie Berthé, Michel Rigo
  • Published online:
    05 March 2013
    Print publication:
    12 August 2010
  • This collaborative volume presents trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory. Presenting several important tools and concepts, the authors also reveal some of the exciting and important relationships that exist between these different fields. Topics include numeration systems, word complexity function, morphic words, Rauzy tilings and substitutive dynamical systems, Bratelli diagrams, frequencies and ergodicity, Diophantine approximation and transcendence, asymptotic properties of digital functions, decidability issues for D0L systems, matrix products and joint spectral radius. Topics are presented in a way that links them to the three main themes, but also extends them to dynamical systems and ergodic theory, fractals, tilings and spectral properties of matrices. Graduate students, research mathematicians and computer scientists working in combinatorics, theory of computation, number theory, symbolic dynamics, fractals, tilings and stringology will find much of interest in this book.

Purity, Spectra and Localisation
  • Mike Prest
  • Published online:
    05 March 2013
    Print publication:
    04 June 2009
  • It is possible to associate a topological space to the category of modules over any ring. This space, the Ziegler spectrum, is based on the indecomposable pure-injective modules. Although the Ziegler spectrum arose within the model theory of modules and plays a central role in that subject, this book concentrates specifically on its algebraic aspects and uses. The central aim is to understand modules and the categories they form through associated structures and dimensions, which reflect the complexity of these, and similar, categories. The structures and dimensions considered arise particularly through the application of model-theoretic and functor-category ideas and methods. Purity and associated notions are central, localisation is an ever-present theme and various types of spectrum play organising roles. This book presents a unified, coherent account of material which is often presented from very different viewpoints and clarifies the relationships between these various approaches.

Introduction to the Network Approximation Method for Materials Modeling
  • Leonid Berlyand, Alexander G. Kolpakov, Alexei Novikov
  • Published online:
    05 February 2013
    Print publication:
    13 December 2012
  • 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.

Real Analysis through Modern Infinitesimals
  • Nader Vakil
  • Published online:
    05 January 2013
    Print publication:
    17 February 2011
  • Real Analysis Through Modern Infinitesimals provides a course on mathematical analysis based on Internal Set Theory (IST) introduced by Edward Nelson in 1977. After motivating IST through an ultrapower construction, the book provides a careful development of this theory representing each external class as a proper class. This foundational discussion, which is presented in the first two chapters, includes an account of the basic internal and external properties of the real number system as an entity within IST. In its remaining fourteen chapters, the book explores the consequences of the perspective offered by IST as a wide range of real analysis topics are surveyed. The topics thus developed begin with those usually discussed in an advanced undergraduate analysis course and gradually move to topics that are suitable for more advanced readers. This book may be used for reference, self-study, and as a source for advanced undergraduate or graduate courses.

Bitangential Direct and Inverse Problems for Systems of Integral and Differential Equations
  • Damir Z. Arov, Harry Dym
  • Published online:
    05 October 2012
    Print publication:
    13 September 2012
  • This largely self-contained treatment surveys, unites and extends some 20 years of research on direct and inverse problems for canonical systems of integral and differential equations and related systems. Five basic inverse problems are studied in which the main part of the given data is either a monodromy matrix; an input scattering matrix; an input impedance matrix; a matrix valued spectral function; or an asymptotic scattering matrix. The corresponding direct problems are also treated. The book incorporates introductions to the theory of matrix valued entire functions, reproducing kernel Hilbert spaces of vector valued entire functions (with special attention to two important spaces introduced by L. de Branges), the theory of J-inner matrix valued functions and their application to bitangential interpolation and extension problems, which can be used independently for courses and seminars in analysis or for self-study. A number of examples are presented to illustrate the theory.

Ellipsoidal Harmonics
  • Theory and Applications
  • George Dassios
  • Published online:
    05 August 2012
    Print publication:
    12 July 2012
  • The sphere is what might be called a perfect shape. Unfortunately nature is imperfect and many bodies are better represented by an ellipsoid. The theory of ellipsoidal harmonics, originated in the nineteenth century, could only be seriously applied with the kind of computational power available in recent years. This, therefore, is the first book devoted to ellipsoidal harmonics. Topics are drawn from geometry, physics, biosciences and inverse problems. It contains classical results as well as new material, including ellipsoidal bi-harmonic functions, the theory of images in ellipsoidal geometry and vector surface ellipsoidal harmonics, which exhibit an interesting analytical structure. Extended appendices provide everything one needs to solve formally boundary value problems. End-of-chapter problems complement the theory and test the reader's understanding. The book serves as a comprehensive reference for applied mathematicians, physicists, engineers and for anyone who needs to know the current state of the art in this fascinating subject.

The Banach-Tarski Paradox
  • Stan Wagon
  • Published online:
    05 August 2012
    Print publication:
    23 May 1985
  • The Banach–Tarski paradox is a most striking mathematical construction: it asserts that a solid ball may be taken apart into finitely many pieces that can be rearranged using rigid motions to form a ball twice as large as the original. This volume explores the consequences of the paradox for measure theory and its connections with group theory, geometry, and logic. It unifies the results of contemporary research on the paradox and presents several new results including some unusual paradoxes in hyperbolic space. It also provides up-to-date proofs and discusses many unsolved problems.

Graph Structure and Monadic Second-Order Logic
  • A Language-Theoretic Approach
  • Bruno Courcelle, Joost Engelfriet
  • Published online:
    05 July 2012
    Print publication:
    14 June 2012
  • The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The authors not only provide a thorough description of the theory, but also detail its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.

Introduction to the Modern Theory of Dynamical Systems
  • Anatole Katok, Boris Hasselblatt
  • Published online:
    05 June 2012
    Print publication:
    28 April 1995
  • This book provided the first self-contained comprehensive exposition of the theory of dynamical systems as a core mathematical discipline closely intertwined with most of the main areas of mathematics. The authors introduce and rigorously develop the theory while providing researchers interested in applications with fundamental tools and paradigms. The book begins with a discussion of several elementary but fundamental examples. These are used to formulate a program for the general study of asymptotic properties and to introduce the principal theoretical concepts and methods. The main theme of the second part of the book is the interplay between local analysis near individual orbits and the global complexity of the orbit structure. The third and fourth parts develop the theories of low-dimensional dynamical systems and hyperbolic dynamical systems in depth. Over 400 systematic exercises are included in the text. The book is aimed at students and researchers in mathematics at all levels from advanced undergraduate up.

Topics in Topological Graph Theory
  • Edited by Lowell W. Beineke, Robin J. Wilson
  • Edited in consultation with Jonathan L. Gross, Thomas W. Tucker
  • Published online:
    05 June 2012
    Print publication:
    09 July 2009
  • The use of topological ideas to explore various aspects of graph theory, and vice versa, is a fruitful area of research. There are links with other areas of mathematics, such as design theory and geometry, and increasingly with such areas as computer networks where symmetry is an important feature. Other books cover portions of the material here, but there are no other books with such a wide scope. This book contains fifteen 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 and the topology of surfaces. Each chapter concludes with an extensive list of references.

The Theory of Information and Coding
  • Student Edition
  • R. J. McEliece
  • Published online:
    05 June 2012
    Print publication:
    15 July 2004
  • This is a revised edition of McEliece's classic, published with students in mind. It is a self-contained introduction to all basic results in the theory of information and coding. This theory was developed to deal with the fundamental problem of communication, that of reproducing at one point, either exactly or approximately, a message selected at another point. There is a short and elementary overview introducing the reader to the concept of coding. Then, following the main results, the channel and source coding theorems, there is a study of specific coding schemes which can be used for channel and source coding. This volume can be used either for self-study, or for a graduate/undergraduate level course at university. It includes dozens of worked examples and several hundred problems for solution. The exposition will be easily comprehensible to readers with some prior knowledge of probability and linear algebra.

The Foundations of Mathematics in the Theory of Sets
  • John P. Mayberry
  • Published online:
    05 March 2012
    Print publication:
    22 March 2001
  • This 2001 book presents a unified approach to the foundations of mathematics in the theory of sets, covering both conventional and finitary (constructive) mathematics. It is based on a philosophical, historical and mathematical analysis of the relation between the concepts of 'natural number' and 'set'. This leads to an investigation of the logic of quantification over the universe of sets and a discussion of its role in second order logic, as well as in the analysis of proof by induction and definition by recursion. The subject matter of the book falls on the borderline between philosophy and mathematics, and should appeal to both philosophers and mathematicians with an interest in the foundations of mathematics.

The One-Dimensional Heat Equation
  • John Rozier Cannon
  • Foreword by Felix E. Browder
  • Published online:
    05 February 2012
    Print publication:
    28 December 1984
  • This is a version of Gevrey's classical treatise on the heat equations. Included in this volume are discussions of initial and/or boundary value problems, numerical methods, free boundary problems and parameter determination problems. The material is presented as a monograph and/or information source book. After the first six chapters of standard classical material, each chapter is written as a self-contained unit except for an occasional reference to elementary definitions, theorems and lemmas in previous chapters.

Iterative Functional Equations

Finite Ordered Sets
  • Concepts, Results and Uses
  • Nathalie Caspard, Bruno Leclerc, Bernard Monjardet
  • Published online:
    05 February 2012
    Print publication:
    26 January 2012
  • Ordered sets are ubiquitous in mathematics and have significant applications in computer science, statistics, biology and the social sciences. As the first book to deal exclusively with finite ordered sets, this book will be welcomed by graduate students and researchers in all of these areas. Beginning with definitions of key concepts and fundamental results (Dilworth's and Sperner's theorem, interval and semiorders, Galois connection, duality with distributive lattices, coding and dimension theory), the authors then present applications of these structures in fields such as preference modelling and aggregation, operational research and management, cluster and concept analysis, and data mining. Exercises are included at the end of each chapter with helpful hints provided for some of the most difficult examples. The authors also point to further topics of ongoing research.

Eigenspaces of Graphs
  • Dragos Cvetkovic, Peter Rowlinson, Slobodan Simic
  • Published online:
    05 December 2011
    Print publication:
    09 January 1997
  • 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.

Ergodic Control of Diffusion Processes
  • Ari Arapostathis, Vivek S. Borkar, Mrinal K. Ghosh
  • Published online:
    05 December 2011
    Print publication:
    17 November 2011
  • This comprehensive volume on ergodic control for diffusions highlights intuition alongside technical arguments. A concise account of Markov process theory is followed by a complete development of the fundamental issues and formalisms in control of diffusions. This then leads to a comprehensive treatment of ergodic control, a problem that straddles stochastic control and the ergodic theory of Markov processes. The interplay between the probabilistic and ergodic-theoretic aspects of the problem, notably the asymptotics of empirical measures on one hand, and the analytic aspects leading to a characterization of optimality via the associated Hamilton–Jacobi–Bellman equation on the other, is clearly revealed. The more abstract controlled martingale problem is also presented, in addition to many other related issues and models. Assuming only graduate-level probability and analysis, the authors develop the theory in a manner that makes it accessible to users in applied mathematics, engineering, finance and operations research.

Page 5 of 9