American Mathematical Society - Böcker

This book contains the collected works of A. Adrian Albert, a leading algebraist of the twentieth century. Albert made many important contributions to the theory of the Brauer group and central simple algebras, Riemann matrices, nonassociative algebras, and other topics. Part 1 focuses on associative algebras and Riemann matrices, and Part 2 on nonassociative algebras and miscellany. Because much of Albert's work remains of vital interest in contemporary research, this volume will interest mathematicians in a variety of areas.

This book contains the collected works of A. Adrian Albert, a leading algebraist of the twentieth century. Albert made many important contributions to the theory of the Brauer group and central simple algeras, Riemann matrices, nonassociative algebras and other topics. Part 1 focuses on associative algebras and Riemann matrices part 2 on nonassociative algebras and miscellany. Because much of Albert's work remains of vital interest in contemporary research, this volume will interst mathematicians in a variety of areas.

This book contains papers of the outstanding and versatile mathematician, Witold Hurewicz. Preceding the collection are introductory articles describing Hurewicz's contributions to Borel sets, dimension theory, and algebraic topology. Hurewicz first studied set theory and dimension, and his papers on this topic are especially clear and precise, making them accessible to beginning mathematicians. His work in algebraic topology is marked by five fundamental papers which provide an introduction to homotopy groups and the Hurewicz Theorem concerning the relation between homotopy and singular homology. These papers are included here in their original form along with English translations. Each paper in the collection is followed by a review from one of the major reviewing journals. These reviews were written by eminent mathematicians and serve as excellent abstracts for the papers.

These lectures emphasized specific areas of operations research and the mathematics used in modeling and solving the related problems. The lecturers were: Seth Bonder, Ralph L. Disney, Frederick C. Johnson, William P. Pierskalla, Robert B. Rovinsky, Warren E. Walker. Each lecturer attempted to make his presentation self-contained in terms of defining the application areas and mathematics employed.

The theory of networks is a very lively one, both in terms of developments in the theory itself and of the variety of its applications. This book, based on the 1981 AMS Short Course on the Mathematics of Networks, introduces most of the basic ideas of network theory and develops some of these ideas considerably. A number of more specialized topics are introduced, including areas of active research and a wide variety of applications. Frank Boesch gives the basic definitions in the mathematics of networks and in the closely-related topic of graph theory. He discusses two of the most fundamental network problems - the shortest path problem and the minimum spanning tree problem as well as some of their variants.Boesch also gives an interesting presentation in the area of network reliability. Frances Yao considers maximum flows in networks, the problem most often thought of in connection with the mathematics of networks. Richard Karp gives an account of the computational complexity of network problems. Using the case study method, Shen Lin demonstrates the effective use of heuristic algorithms in network design. Four applications of the mathematics of networks are presented by Daniel Kleitman. These include: the design of irrigation systems, the theory of electrical networks, the scheduling of delivery trucks, and the physics of ice. Finally, Nicholas Pippenger presents a chapter on telephone switching networks, an area of network theory that leads to difficult mathematics drawn from such apparently unrelated fields as harmonic analysis.

This book consists of two main parts. The first part, ""Hyperbolic and Parabolic Equations"", written by F. John, contains a well-chosen assortment of material intended to give an understanding of some problems and techniques involving hyperbolic and parabolic equations. The emphasis is on illustrating the subject without attempting to survey it. The point of view is classical, and this serves well in furnishing insight into the subject; it also makes it possible for the lectures to be read by someone familiar with only the fundamentals of real and complex analysis.The second part, ""Elliptic Equations"", written by L. Bers and M. Schechter, contains a very readable account of the results and methods of the theory of linear elliptic equations, including the maximum principle, Hilbert-space methods, and potential-theoretic methods. It also contains a brief discussion of some quasi-linear elliptic equations. The book is suitable for graduate students and researchers interested in partial differential equations.

This is the proceedings of the 1983 AMS Short Course given at Denver, Colorado. Computer communications is characterized by rapid technological advances presenting problems of a theoretical nature that are often very difficult to solve. They range from those that arise on a single chip, where communication among thousands of elements on a chip is influenced by electrical properties, to those that arise when human beings communicate with databases where the logical aspects of communications play a more important role. A variety of mathematical methods is needed to attempt to solve such problems; they vary from partial differential equations to temporal or modal logic. The article on ""Diffusion Approximation"" is probably one of the best reviews of this field. The book is unique in having contributors from a variety of different fields of computer communications. All of the articles are of high research value and are self-contained.

The lecture notes contained in this volume were presented at the AMS Short Course on Population Biology, held August 6-7, 1983, in Albany, New York in conjunction with the summer meeting of the American Mathematical Society. These notes will acquaint the reader with the mathematical ideas that pervade almost every level of thinking in population biology and provide an introduction to the many applications of mathematics in the field.Research mathematicians, college teachers of mathematics, and graduate students all should find this book of interest. Population biology is probably the oldest area in mathematical biology, but remains a constant source of new mathematical problems and the area of biology best integrated with mathematical theory. The need for mathematical approaches has never been greater, as evolutionary theory is challenged by new interpretations of the paleontological record and new discoveries at the molecular level, as world resources for feeding populations become limiting, as the problems of pollution increase, and as both animal and plant epidemiological problems receive closer scrutiny. A background of advanced calculus, introduction to ordinary and partial differential equations, and linear algebra will make the book accessible. All of the papers included have high research value. A list of the contents follows.

These introductory survey lectures, the result of a 1984 AMS Short Course, focus on the algorithmic problems arising in the construction and utilization of large-scale information systems. Addressed to both mathematicians and computer scientists, the lectures require a background in the methodologies of discrete mathematics, in particular the elements of algebra, combinatorics and graph theory, discrete probability, logic and the theory of computation. All of the articles either are of high research value or survey profound themes in current research. They cover the two fundamental aspects of the field, i.e., database systems and communication networks.An overview of database architectures, the theory of data dependencies, and transaction management are provided, respectively, by the articles of Jacobs, Fagin and Vardi, and Garcia-Molina. Chung evaluates problems in the design of communication networks. Miller's discussion of data compression algorithms links current research to classical information theory. Finally, Tuzhilin describes a general framework evolved in the Soviet Union for modelling problems of information processing.

This collection of six papers provides a valuable source of material on the real-world problem of allocating objects among competing claimants. The examples given show how mathematics, particularly the axiomatic method, can be applied to give insight into complex social problems. Originally presented as an AMS Short Course, these papers could serve as a suitable text for courses touching on game theory, decision sciences, economics, or quantitative political science. Most of the material is accessible to the mathematically mature undergraduate with a background in advanced calculus and algebra. Each article surveys the recent literature and includes statements and sketches of proofs, as well as unsolved problems which should excite student curiosity.The articles analyze the question of fair allocation via six examples: the apportionment of political representation, the measurement of income inequality, the allocation of joint costs, the levying of taxes, the design of voting laws, and the framing of auction procedures. In each of these examples fairness has a somewhat different significance, but common axiomatic threads reveal broad underlying principles. Each of the topics is concerned with norms of comparative equity for evaluating allocations or with standards of procedures for effecting them; it is this focus on normative properties which suggests that a mathematical analysis is appropriate. Though game theory provides a useful tool in many of these allocation problems, the emphasis here is on standards rather than strategy and equity rather than rationality, an approach which more accurately mirrors real-world social problems.

These lecture notes from the 1985 AMS Short Course examine a variety of topics from the contemporary theory of actuarial mathematics. Recent clarification in the concepts of probability and statistics has laid a much richer foundation for this theory. Other factors that have shaped the theory include the continuing advances in computer science, the flourishing mathematical theory of risk, developments in stochastic processes, and recent growth in the theory of finance. In turn, actuarial concepts have been applied to other areas such as biostatistics, demography, economic, and reliability engineering.

In the 100 years since the founding of the AMS, the American mathematical community has grown from a small group heavily dependent on European mathematicians to a large and influential group that in many areas sets the standard for the rest of the world. By the 1930s, there was a flourishing mathematical community to welcome the influx of mathematicians fleeing Europe. This volume, the first in the History of Mathematics series, brings together a variety of perspectives on the political, social, and mathematical forces that have shaped the American mathematical community in the past century.

Computational complexity theory is the study of the quantitative laws that govern computing. During the last 25 years, this field has grown into a rich mathematical theory. Currently one of the most active research areas in computer science, complexity theory is of considerable interest to mathematicians as well, since some of the key open problems in this field raise basic questions about the nature of mathematics. Many experts in complexity theory believe that, in coming decades, the strongest influence on the development of mathematics will come from the extended use of computing and from concepts and problems arising in computer science.This volume contains the proceedings of the AMS Short Course on Computational Complexity Theory, held at the Joint Mathematics Meetings in Atlanta in January 1988. The purpose of the short course was to provide an overview of complexity theory and to describe some of the current developments in the field. The papers presented here represent contributions by some of the top experts in this burgeoning area of research.

This volume contains the proceedings of a highly successful AMS Short Course on Chaos and Fractals, held during the AMS Centennial Celebration in Providence, Rhode Island in August 1988. Chaos and fractals have been the subject of great interest in recent years and have proven to be useful in a variety of areas of mathematics and the sciences. The purpose of the short course was to provide a solid introduction to the mathematics underlying the notions of chaos and fractals. The papers in this book range over such topics as dynamical systems theory, Julia sets, the Mandelbrot set, attractors, the Smale horseshoe, calculus on fractals, and applications to data compression. The authors represented here are some of the top experts in this field. Aimed at beginning graduate students, college and university mathematics instructors, and non-mathematics researchers, this book provides readable expositions of several exciting topics of contemporary research.

This volume, a joint publication with the American Institute of Physics, contains the proceedings of a symposium honoring the memory of Josiah Willard Gibbs, one of the giants of theoretical physics. Three articles provide perspectives on Gibbs, the man, and on the place his work occupies in the history of science. There are also contributions from leading scientists on statistical mechanics, thermodynamics, geophysics, number theory, general relativity, and economics.

Anatolii Fomenko is a Soviet mathematician with a talent for expressing abstract mathematical concepts through artwork. Some of his works echo those of M. C. Escher in their meticulous rendering of shapes and patterns, while other pieces seem to be more visceral expressions of mathematical ideas. Stimulating to the imagination and to the eye, his rich and evocative work can be interpreted and appreciated in various ways - mathematical, aesthetic, or emotional. This book contains 84 reproductions of works by Fomenko, 23 of them in colour. In the accompanying captions, Fomenko explains the mathematical motivation behind the illustrations as well as the emotional, historical, or mythical subtexts that they evoke. The illustrations carry the viewer through a mathematical world consisting not of equations and dry logic, but of intuition and inspiration.

Throughout the history of mathematics, maximum and minimum problems have played an important role in the evolution of the field. Many beautiful and important problems have appeared in a variety of branches of mathematics and physics, as well as in other fields of sciences. The greatest scientists of the past - Euclid, Archimedes, Heron, the Bernoullis, Newton, and many others - took part in seeking solutions to these concrete problems. The solutions stimulated the development of the theory, and, as a result, techniques were elaborated that made possible the solution of a tremendous variety of problems by a single method. This book presents fifteen 'stories' designed to acquaint readers with the central concepts of the theory of maxima and minima, as well as with its illustrious history.This book is accessible to high school students and would likely be of interest to a wide variety of readers. In Part One, the author familiarizes readers with many concrete problems that lead to discussion of the work of some of the greatest mathematicians of all time. Part Two introduces a method for solving maximum and minimum problems that originated with Lagrange. While the content of this method has varied constantly, its basic conception has endured for over two centuries. The final story is addressed primarily to those who teach mathematics, for it impinges on the question of how and why to teach. Throughout the book, the author strives to show how the analysis of diverse facts gives rise to a general idea, how this idea is transformed, how it is enriched by new content, and how it remains the same in spite of these changes.

There are a number of very good books available on linear algebra. From this one might deduce that the existing books contain all that one needs to know in the best possible form and that any new book would just repeat material in the old ones. However, new results in linear algebra appear constantly, as do new, simpler, and better proofs of old results. Many linear algebra results obtained in the past thirty years are accessible to undergraduate mathematics majors, but are usually ignored by textbooks. In addition, more than a few interesting old results are not covered in many books. In this book, Prasolov provides the basics of linear algebra, with an emphasis on new results and on nonstandard and interesting proofs. The book features about 230 problems with complete solutions. It would be a fine supplementary text for an undergraduate or graduate algebra course.

The interconnection network is one of the most basic components of a massively parallel computer system. Such systems consist of hundreds or thousands of processors interconnected to work cooperatively on computations. One of the central problems in parallel computing is the task of mapping a collection of processes onto the processors and routing network of a parallel machine. Once this mapping is done, it is critical to schedule computations within and communication among processors so that the necessary inputs for a process are available where and when the process is scheduled to be computed.This book contains the refereed proceedings of a DIMACS Workshop on Massively Parallel Computation, held in February 1994. The workshop brought together researchers from universities and laboratories, as well as practitioners involved in the design, implementation, and application of massively parallel systems. Focusing on interconnection networks of parallel architectures of today and of the near future, the book includes topics such as network topologies, network properties, message routing, network embeddings, network emulation, mappings, and efficient scheduling.