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 7 of 9

Orthonormal Systems and Banach Space Geometry
  • Albrecht Pietsch, Jörg Wenzel
  • Published online:
    10 December 2009
    Print publication:
    10 September 1998
  • 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.

Combinatorial Species and Tree-like Structures
  • François Bergeron, Gilbert Labelle, Pierre Leroux
  • Translated by Margaret Readdy
  • Published online:
    05 May 2013
    Print publication:
    13 November 1997
  • The combinatorial theory of species, introduced by Joyal in 1980, provides a unified understanding of the use of generating functions for both labelled and unlabelled structures and as a tool for the specification and analysis of these structures. Of particular importance is their capacity to transform recursive definitions of tree-like structures into functional or differential equations, and vice versa. The goal of this book is to present the basic elements of the theory and to give a unified account of its developments and applications. It offers a modern introduction to the use of various generating functions, with applications to graphical enumeration, Polya theory and analysis of data structures in computer science, and to other areas such as special functions, functional equations, asymptotic analysis and differential equations. This book will be a valuable reference to graduate students and researchers in combinatorics, analysis, and theoretical computer science.

Probabilistic Methods in Combinatorial Analysis
  • Vladimir N. Sachkov
  • Translated by V. A. Vatutin
  • Published online:
    18 March 2010
    Print publication:
    15 May 1997
  • 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.

Nonnegative Matrices and Applications
  • R. B. Bapat, T. E. S. Raghavan
  • Published online:
    17 September 2009
    Print publication:
    28 March 1997
  • This book provides an integrated treatment of the theory of nonnegative matrices (matrices with only positive numbers or zero as entries) and some related classes of positive matrices, concentrating on connections with game theory, combinatorics, inequalities, optimisation and mathematical economics. The wide variety of applications, which include price fixing, scheduling and the fair division problem, have been carefully chosen both for their elegant mathematical content and for their accessibility to students with minimal preparation. Many results in matrix theory are also presented. The treatment is rigorous and almost all results are proved completely. These results and applications will be of great interest to researchers in linear programming, statistics and operations research. The minimal prerequisites also make the book accessible to first-year graduate students.

Sperner Theory
  • Konrad Engel
  • Published online:
    08 January 2010
    Print publication:
    28 January 1997
  • The starting point of this book is Sperner's theorem, which answers the question: What is the maximum possible size of a family of pairwise (with respect to inclusion) subsets of a finite set? This theorem stimulated the development of a fast growing theory dealing with external problems on finite sets and, more generally, on finite partially ordered sets. This book presents Sperner theory from a unified point of view, bringing combinatorial techniques together with methods from programming, linear algebra, Lie-algebra representations and eigenvalue methods, probability theory, and enumerative combinatorics. Researchers and graduate students in discrete mathematics, optimisation, algebra, probability theory, number theory, and geometry will find many powerful new methods arising from Sperner theory.

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.

Finite Fields
  • 2nd edition
  • Rudolf Lidl, Harald Niederreiter
  • Published online:
    02 November 2009
    Print publication:
    24 October 1996
  • 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.

Geometric Applications of Fourier Series and Spherical Harmonics
  • Helmut Groemer
  • Published online:
    11 September 2009
    Print publication:
    13 September 1996
  • This book provides a comprehensive presentation of geometric results, primarily from the theory of convex sets, that have been proved by the use of Fourier series or spherical harmonics. An important feature of the book is that all necessary tools from the classical theory of spherical harmonics are presented with full proofs. These tools are used to prove geometric inequalities, stability results, uniqueness results for projections and intersections by hyperplanes or half-spaces and characterisations of rotors in convex polytopes. Again, full proofs are given. To make the treatment as self-contained as possible the book begins with background material in analysis and the geometry of convex sets. This treatise will be welcomed both as an introduction to the subject and as a reference book for pure and applied mathematics.

Minkowski Geometry
  • A. C. Thompson
  • Published online:
    05 May 2013
    Print publication:
    28 June 1996
  • Minkowski geometry is a type of non-Euclidean geometry in a finite number of dimensions in which distance is not 'uniform' in all directions. This book presents the first comprehensive treatment of Minkowski geometry since the 1940s. The author begins by describing the fundamental metric properties and the topological properties of existence of Minkowski space. This is followed by a treatment of two-dimensional spaces and characterisations of Euclidean space among normed spaces. The central three chapters present the theory of area and volume in normed spaces, a fascinating geometrical interplay among the various roles of the ball in Euclidean space. Later chapters deal with trigonometry and differential geometry in Minkowski spaces. The book ends with a brief look at J. J. Schaffer's ideas on the intrinsic geometry of the unit sphere. Minkowski Geometry will appeal to students and researchers interested in geometry, convexity theory and functional analysis.

Padé Approximants
  • 2nd edition
  • George A. Baker, Peter Graves-Morris
  • Published online:
    29 September 2009
    Print publication:
    26 January 1996
  • The first edition of this book was reviewed in 1982 as 'the most extensive treatment of Padé approximants actually available'. This second edition has been thoroughly updated, with a substantial chapter on multiseries approximants. Applications to statistical mechanics and critical phenomena are extensively covered, and there are extended sections devoted to circuit design, matrix Pade approximation, and computational methods. This succinct and straightforward treatment will appeal to scientists, engineers, and mathematicians alike.

Combinatorial Methods in Discrete Mathematics
  • Vladimir N. Sachkov
  • Translated by V. Kolchin
  • Published online:
    22 March 2010
    Print publication:
    11 January 1996
  • 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.

Bounded Arithmetic, Propositional Logic and Complexity Theory
  • Jan Krajicek
  • Published online:
    02 December 2009
    Print publication:
    24 November 1995
  • 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.

Skew Fields
  • Theory of General Division Rings
  • P. M. Cohn
  • Published online:
    05 November 2011
    Print publication:
    28 July 1995
  • Non-commutative fields (also called skew fields or division rings) have not been studied as thoroughly as their commutative counterparts, and most accounts have hitherto been confined to division algebras - that is skew fields finite dimensional over their centre. Based on the author's LMS lecture note volume Skew Field Constructions, the present work offers a comprehensive account of skew fields. The axiomatic foundation, and a precise description of the embedding problem, is followed by an account of algebraic and topological construction methods, in particular, the author's general embedding theory is presented with full proofs, leading to the construction of skew fields. The powerful coproduct theorem of G. M. Bergman is proved here, as well as the properties of the matrix reduction functor, a useful but little-known construction providing a source of examples and counter-examples. The construction and basic properties of existentially closed skew fields are given, leading to an example of a model class with an infinite forcing companion which is not axiomatizable.

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.

Handbook of Categorical Algebra
  • Volume 3, Sheaf Theory
  • Francis Borceux
  • Published online:
    04 February 2010
    Print publication:
    08 December 1994
  • The Handbook of Categorical Algebra is intended to give, in three volumes, a rather detailed account of what, ideally, everybody working in category theory should know, whatever the specific topic of research they have chosen. The book is planned also to serve as a reference book for both specialists in the field and all those using category theory as a tool. Volume 3 begins with the essential aspects of the theory of locales, proceeding to a study in chapter 2 of the sheaves on a locale and on a topological space, in their various equivalent presentations: functors, etale maps or W-sets. Next, this situation is generalized to the case of sheaves on a site and the corresponding notion of Grothendieck topos is introduced. Chapter 4 relates the theory of Grothendieck toposes with that of accessible categories and sketches, by proving the existence of a classifying topos for all coherent theories.

Handbook of Categorical Algebra
  • Volume 2, Categories and Structures
  • Francis Borceux
  • Published online:
    30 December 2009
    Print publication:
    03 November 1994
  • The Handbook of Categorical Algebra is designed to give, in three volumes, a detailed account of what should be known by everybody working in, or using, category theory. As such it will be a unique reference. The volumes are written in sequence. The second, which assumes familiarity with the material in the first, introduces important classes of categories that have played a fundamental role in the subject's development and applications. In addition, after several chapters discussing specific categories, the book develops all the major concepts concerning Benabou's ideas of fibred categories. There is ample material here for a graduate course in category theory, and the book should also serve as a reference for users.

Handbook of Categorical Algebra
  • Volume 1, Basic Category Theory
  • Francis Borceux
  • Published online:
    30 December 2009
    Print publication:
    26 August 1994
  • A Handbook of Categorical Algebra is designed to give, in three volumes, a detailed account of what should be known by everybody working in, or using, category theory. As such it will be a unique reference. The volumes are written in sequence, with the first being essentially self-contained, and are accessible to graduate students with a good background in mathematics. Volume 1, which is devoted to general concepts, can be used for advanced undergraduate courses on category theory. After introducing the terminology and proving the fundamental results concerning limits, adjoint functors and Kan extensions, the categories of fractions are studied in detail; special consideration is paid to the case of localizations. The remainder of the first volume studies various 'refinements' of the fundamental concepts of category and functor.

Banach Algebras and the General Theory of *-Algebras
  • Volume 1, Algebras and Banach Algebras
  • Theodore W. Palmer
  • Published online:
    05 May 2013
    Print publication:
    25 March 1994
  • This is the first volume of a two volume set that provides a modern account of basic Banach algebra theory including all known results on general Banach *-algebras. This account emphasises the role of *-algebra structure and explores the algebraic results which underlie the theory of Banach algebras and *-algebras. This first volume is an independent, self-contained reference on Banach algebra theory. Each topic is treated in the maximum interesting generality within the framework of some class complex algebras rather than topological algebras. In both volumes proofs are presented in complete detail at a level accessible to graduate students. In addition, the books contain a wealth of historical comments, background material, examples, particularly in noncommutative harmonic analysis, and an extensive bibliography. Together these books will become the standard reference for the general theory of *-algebras.

Computation with Finitely Presented Groups
  • Charles C. Sims
  • Published online:
    06 March 2010
    Print publication:
    28 January 1994
  • Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theoretical computer scientists will find this book useful.

Model Theory
  • Wilfrid Hodges
  • Published online:
    08 October 2009
    Print publication:
    11 March 1993
  • This is an up-to-date and integrated introduction to model theory, designed to be used for graduate courses (for students who are familiar with first-order logic), and as a reference for more experienced logicians and mathematicians. Model theory is concerned with the notions of definition, interpretation and structure in a very general setting, and is applied to a wide variety of other areas such as set theory, geometry, algebra (in particular group theory), and computer science (e.g. logic programming and specification). Professor Hodges emphasises definability and methods of construction, and introduces the reader to advanced topics such as stability. He also provides the reader with much historical information and a full bibliography, enhancing the book's use as a reference.

Page 7 of 9