Skip to main content
Elsevier
View Cart

North Holland

    • The Infinite-Dimensional Topology of Function Spaces

      • 1st Edition
      • Volume 64
      • June 15, 2001
      • J. van Mill
      • English
      • Paperback
        9 7 8 0 4 4 4 5 6 1 8 6 2
      • Hardback
        9 7 8 0 4 4 4 5 0 5 5 7 6
      • Paperback
        9 7 8 0 4 4 4 5 0 8 4 9 2
      • eBook
        9 7 8 0 0 8 0 9 2 9 7 7 4
      • eBook
        9 7 8 0 0 8 0 9 2 9 4 9 1
      In this book we study function spaces of low Borel complexity.Technique... from general topology, infinite-dimensional topology, functional analysis and descriptive set theoryare primarily used for the study of these spaces. The mix ofmethods from several disciplines makes the subjectparticularly interesting. Among other things, a complete and self-contained proof of the Dobrowolski-Marcisze... Theorem that all function spaces of low Borel complexity are topologically homeomorphic, is presented.In order to understand what is going on, a solid background ininfinite-dimension... topology is needed. And for that a fair amount of knowledge of dimension theory as well as ANR theory is needed. The necessary material was partially covered in our previous book `Infinite-dimensiona... topology, prerequisites and introduction'. A selection of what was done there can be found here as well, but completely revised and at many places expanded with recent results. A `scenic' route has been chosen towards theDobrowolski-Marci... Theorem, linking theresults needed for its proof to interesting recent research developments in dimension theory and infinite-dimensional topology.The first five chapters of this book are intended as a text forgraduate courses in topology. For a course in dimension theory, Chapters 2 and 3 and part of Chapter 1 should be covered. For a course in infinite-dimensional topology, Chapters 1, 4 and 5. In Chapter 6, which deals with function spaces, recent research results are discussed. It could also be used for a graduate course in topology but its flavor is more that of a research monograph than of a textbook; it is thereforemore suitable as a text for a research seminar. The bookconsequently has the character of both textbook and a research monograph. In Chapters 1 through 5, unless statedotherwise, all spaces under discussion are separable andmetrizable. In Chapter 6 results for more general classes of spaces are presented.In Appendix A for easy reference and some basic facts that are important in the book have been collected. The book is not intended as a basis for a course in topology; its purpose is to collect knowledge about general topology.The exercises in the book serve three purposes: 1) to test the reader's understanding of the material 2) to supply proofs of statements that are used in the text, but are not proven there3) to provide additional information not covered by the text.Solutions to selected exercises have been included in Appendix B.These exercises are important or difficult.

    • Banach Spaces

      • 1st Edition
      • Volume 1
      • April 30, 2001
      • English
      • Hardback
        9 7 8 0 4 4 4 5 0 7 4 9 5
      • Paperback
        9 7 8 0 4 4 4 5 4 6 7 9 1
      • eBook
        9 7 8 0 0 8 0 5 2 8 3 7 3

    • Graphs of Groups on Surfaces

      • 1st Edition
      • Volume 188
      • April 27, 2001
      • A.T. White
      • English
      • Paperback
        9 7 8 0 4 4 4 5 4 6 6 9 2
      • Hardback
        9 7 8 0 4 4 4 5 0 0 7 5 5
      • eBook
        9 7 8 0 0 8 0 5 0 7 5 8 3
      The book, suitable as both an introductory reference and as a text book in the rapidly growing field of topological graph theory, models both maps (as in map-coloring problems) and groups by means of graph imbeddings on sufaces. Automorphism groups of both graphs and maps are studied. In addition connections are made to other areas of mathematics, such as hypergraphs, block designs, finite geometries, and finite fields. There are chapters on the emerging subfields of enumerative topological graph theory and random topological graph theory, as well as a chapter on the composition of English church-bell music. The latter is facilitated by imbedding the right graph of the right group on an appropriate surface, with suitable symmetries. Throughout the emphasis is on Cayley maps: imbeddings of Cayley graphs for finite groups as (possibly branched) covering projections of surface imbeddings of loop graphs with one vertex. This is not as restrictive as it might sound; many developments in topological graph theory involve such imbeddings.The approach aims to make all this interconnected material readily accessible to a beginning graduate (or an advanced undergraduate) student, while at the same time providing the research mathematician with a useful reference book in topological graph theory. The focus will be on beautiful connections, both elementary and deep, within mathematics that can best be described by the intuitively pleasing device of imbedding graphs of groups on surfaces.

    • Codes on Euclidean Spheres

      • 1st Edition
      • Volume 63
      • April 27, 2001
      • T. Ericson + 1 more
      • English
      • Paperback
        9 7 8 0 4 4 4 5 5 1 7 6 4
      • Hardback
        9 7 8 0 4 4 4 5 0 3 2 9 9
      • eBook
        9 7 8 0 0 8 0 5 0 2 1 6 8
      Codes on Euclidean spheres are often referred to as spherical codes. They are of interest from mathematical, physical and engineering points of view. Mathematically the topic belongs to the realm of algebraic combinatorics, with close connections to number theory, geometry, combinatorial theory, and - of course - to algebraic coding theory. The connections to physics occur within areas like crystallography and nuclear physics. In engineering spherical codes are of central importance in connection with error-control in communication systems. In that context the use of spherical codes is often referred to as "coded modulation." The book offers a first complete treatment of the mathematical theory of codes on Euclidean spheres. Many new results are published here for the first time. Engineering applications are emphasized throughout the text. The theory is illustrated by many examples. The book also contains an extensive table of best known spherical codes in dimensions 3-24, including exact constructions.

    • Parallel Computational Fluid Dynamics 2000

      • 1st Edition
      • April 27, 2001
      • C.B. Jenssen + 7 more
      • English
      • Hardback
        9 7 8 0 4 4 4 5 0 6 7 3 3
      • Paperback
        9 7 8 0 4 4 4 5 5 1 8 0 1
      • eBook
        9 7 8 0 0 8 0 5 3 8 4 0 2
      Parallel CFD 2000, the Twelfth in an International series of meetings featuring computational fluid dynamics research on parallel computers, was held May 22-25, 2000 in Trondheim, Norway.Following the trend of the past conferences, areas such as numerical schemes and algorithms, tools and environments, load balancing, as well as interdisciplinary topics and various kinds of industrial applications were all well represented in the work presented. In addition, for the first time in the Parallel CFD conference series, the organizing committee chose to draw special attention to certain subject areas by organizing a number of special sessions.We feel the emphasis of the papers presented at the conference reflect the direction of the research within parallel CFD at the beginning of the new millennium. It seems to be a clear tendency towards increased industrial exploitation of parallel CFD. Several presentations also demonstrated how new insight is being achieved from complex simulations, and how powerful parallel computers now make it possible to use CFD within a broader interdisciplinary setting.Obviously, successful application of parallel CFD still rests on the underlying fundamental principles. Therefore, numerical algorithms, development tools, and parallelization techniques are still as important as when parallel CFD was in is infancy. Furthermore, the novel concepts of affordable parallel computing as well as metacomputing show that exciting developments are still taking place.As is often pointed out however, the real power of parallel CFD comes from the combination of all the disciplines involved: Physics, mathematics, and computer science. This is probably one of the principal reasons for the continued popularity of the Parallel CFD Conferences series, as well as the inspiration behind much of the excellent work carried out on the subject. We hope that the papers in this book, both on an individual basis and as a whole, will contribute to that inspiration. Further details of Parallel CFD'99, as well as other conferences in this series, are available at http://www.parcfd.or...

    • Handbook of Magnetic Materials

      • 1st Edition
      • Volume 13
      • April 26, 2001
      • K.H.J. Buschow
      • English
      • Hardback
        9 7 8 0 4 4 4 5 0 6 6 6 5
      • eBook
        9 7 8 0 0 8 0 9 5 3 6 6 3
      Volume 13 of the Handbook of Magnetic Materials, as the preceding volumes, has a dual purpose. As a textbook it is intended to be of assistance to those who wish to be introduced to a given topic in the field of magnetism without the need to read the vast amount of literature published. As a work of reference it is intended for scientists active in magnetism research. To this dual purpose, Volume 13 of the Handbook is composed of topical review articles written by leading authorities. In each of these articles an extensive description is given in graphical as well as in tabular form, much emphasis being placed on the discussion of the experimental material in the framework of physics, chemistry and material science. In Chapter 1 of this volume a general review of the experimental work on interlayer exchange coupling is presented along with a discussion of the current understanding of this field. There exists an extensive amount of scientific efforts devoted to 4f and 5f systems, including experimental and theoretical, as well as basic and applied research. Chapter 2 aims at reviewing a part of these efforts from the viewpoint of microscopic theory. Special attention is paid to the many new developments in the field. One of the intentions is to bring to the fore the darker areas of DFT theory applications. A review of novel experimental results and first-principle energy-band calculations of MOKE spectra will be presented in Chapter 3. Conventional co-operative phenomena, such as long-range order and elementary excitation, have realisations in nonmagnetic situations. This applies also to the phenomena of geometrical frustration. In Chapter 4 this topic is addressed by developing the basic principles underlying the magnetic phenomena.

    • Nonlinear Equations and Optimisation

      • 1st Edition
      • Volume 4
      • March 14, 2001
      • L.T. Watson + 2 more
      • English
      • Paperback
        9 7 8 0 4 4 4 5 0 5 9 9 6
      • eBook
        9 7 8 0 0 8 0 9 2 9 5 4 5
      /homepage/sac/cam/na... Set now available at special set price !In one of the papers in this collection, the remark that "nothing at all takes place in the universe in which some rule of maximum of minimum does not appear" is attributed to no less an authority than Euler. Simplifying the syntax a little, we might paraphrase this as Everything is an optimization problem. While this might be something of an overstatement, the element of exaggeration is certainly reduced if we consider the extended form: Everything is an optimization problem or a system of equations. This observation, even if only partly true, stands as a fitting testimonial to the importance of the work covered by this volume.Since the 1960s, much effort has gone into the development and application of numerical algorithms for solving problems in the two areas of optimization and systems of equations. As a result, many different ideas have been proposed for dealing efficiently with (for example) severe nonlinearities and/or very large numbers of variables. Libraries of powerful software now embody the most successful of these ideas, and one objective of this volume is to assist potential users in choosing appropriate software for the problems they need to solve. More generally, however, these collected review articles are intended to provide both researchers and practitioners with snapshots of the 'state-of-the-art' with regard to algorithms for particular classes of problem. These snapshots are meant to have the virtues of immediacy through the inclusion of very recent ideas, but they also have sufficient depth of field to show how ideas have developed and how today's research questions have grown out of previous solution attempts.The most efficient methods for local optimization, both unconstrained and constrained, are still derived from the classical Newton approach.As well as dealing in depth with the various classical, or neo-classical, approaches, the selection of papers on optimization in this volume ensures that newer ideas are also well represented.Solving nonlinear algebraic systems of equations is closely related to optimization. The two are not completely equivalent, however, and usually something is lost in the translation.Algorith... for nonlinear equations can be roughly classified as locally convergent or globally convergent. The characterization is not perfect.Locally convergent algorithms include Newton's method, modern quasi-Newton variants of Newton's method, and trust region methods. All of these approaches are well represented in this volume.

    • Rudiments of Calculus

      • 1st Edition
      • Volume 146
      • February 7, 2001
      • A. Arnold + 1 more
      • English
      • Paperback
        9 7 8 0 4 4 4 5 5 1 7 7 1
      • Hardback
        9 7 8 0 4 4 4 5 0 6 2 0 7
      • eBook
        9 7 8 0 0 8 0 5 1 6 4 5 5
      This book presents what in our opinion constitutes the basis of the theory of the mu-calculus, considered as an algebraic system rather than a logic. We have wished to present the subject in a unified way, and in a form as general as possible. Therefore, our emphasis is on the generality of the fixed-point notation, and on the connections between mu-calculus, games, and automata, which we also explain in an algebraic way. This book should be accessible for graduate or advanced undergraduate students both in mathematics and computer science. We have designed this book especially for researchers and students interested in logic in computer science, comuter aided verification, and general aspects of automata theory. We have aimed at gathering in a single place the fundamental results of the theory, that are currently very scattered in the literature, and often hardly accessible for interested readers. The presentation is self-contained, except for the proof of the Mc-Naughton's Determinization Theorem (see, e.g., [97]. However, we suppose that the reader is already familiar with some basic automata theory and universal algebra. The references, credits, and suggestions for further reading are given at the end of each chapter.

    • The Theory of Fractional Powers of Operators

      • 1st Edition
      • Volume 187
      • January 17, 2001
      • C. Martinez + 1 more
      • English
      • Paperback
        9 7 8 0 4 4 4 5 4 2 1 3 7
      • eBook
        9 7 8 0 0 8 0 5 1 9 0 7 4
      This book makes available to researchers and advanced graduates a simple and direct presentation of the fundamental aspects of the theory of fractional powers of non-negative operators, which have important links with partial differential equations and harmonic analysis. For the first time ever, a book deals with this subject monographically, despite the large number of papers written on it during the second half of the century. The first chapters are concerned with the construction of a basic theory of fractional powers and study the classic questions in that respect. A new and distinct feature is that the approach adopted has allowed the extension of this theory to locally convex spaces, thereby including certain differential operators, which appear naturally in distribution spaces. The bulk of the second part of the book is dedicated to powers with pure imaginary exponents, which have been the focus of research in recent years, ever since the publication in 1987 of the now classic paper by G.Dore and A.Venni. Special care has been taken to give versions of the results with more accurate hypotheses, particularly with respect to the density of the domain or the range of the operator. The authors have made a point of making the text clear and self-contained. Accordingly, an extensive appendix contains the material on real and functional analysis used and, at the end of each chapter there are detailed historical and bibliographical notes in order to understand the development and current state of research into the questions dealt with.

    • Theory of Relations

      • 1st Edition
      • Volume 145
      • December 15, 2000
      • R. Fraisse
      • English
      • Hardback
        9 7 8 0 4 4 4 5 0 5 4 2 2
      • Paperback
        9 7 8 0 4 4 4 5 4 4 2 0 9
      • eBook
        9 7 8 0 0 8 0 5 1 9 1 1 1
      Relation theory originates with Hausdorff (Mengenlehre 1914) and Sierpinski (Nombres transfinis, 1928) with the study of order types, specially among chains = total orders = linear orders. One of its first important problems was partially solved by Dushnik, Miller 1940 who, starting from the chain of reals, obtained an infinite strictly decreasing sequence of chains (of continuum power) with respect to embeddability. In 1948 I conjectured that every strictly decreasing sequence of denumerable chains is finite. This was affirmatively proved by Laver (1968), in the more general case of denumerable unions of scattered chains (ie: which do not embed the chain Q of rationals), by using the barrier and the better orderin gof Nash-Williams (1965 to 68).Another important problem is the extension to posets of classical properties of chains. For instance one easily sees that a chain A is scattered if the chain of inclusion of its initial intervals is itself scattered (6.1.4). Let us again define a scattered poset A by the non-embedding of Q in A. We say that A is finitely free if every antichain restriction of A is finite (antichain = set of mutually incomparable elements of the base). In 1969 Bonnet and Pouzet proved that a poset A is finitely free and scattered iff the ordering of inclusion of initial intervals of A is scattered. In 1981 Pouzet proved the equivalence with the a priori stronger condition that A is topologically scattered: (see 6.7.4; a more general result is due to Mislove 1984); ie: every non-empty set of initial intervals contains an isolated elements for the simple convergence topology.In chapter 9 we begin the general theory of relations, with the notions of local isomorphism, free interpretability and free operator (9.1 to 9.3), which is the relationist version of a free logical formula. This is generalized by the back-and-forth notions in 10.10: the (k,p)-operator is the relationist version of the elementary formula (first order formula with equality).Chapter 12 connects relation theory with permutations: theorem of the increasing number of orbits (Livingstone, Wagner in 12.4). Also in this chapter homogeneity is introduced, then more deeply studied in the Appendix written by Norbert Saucer.Chapter 13 connects relation theory with finite permutation groups; the main notions and results are due to Frasnay. Also mention the extension to relations of adjacent elements, by Hodges, Lachlan, Shelah who by this mean give an exact calculus of the reduction threshold.The book covers almost all present knowledge in Relation Theory, from origins (Hausdorff 1914, Sierpinski 1928) to classical results (Frasnay 1965, Laver 1968, Pouzet 1981) until recent important publications (Abraham, Bonnet 1999).All results are exposed in axiomatic set theory. This allows us, for each statement, to specify if it is proved only from ZF axioms of choice, the continuum hypothesis or only the ultrafilter axiom or the axiom of dependent choice, for instance.

Browse by Publisher

Academic Press

Butterworth-Heinemann

Chandos

Elsevier

Morgan Kaufmann

Newnes

Syngress