This book is based on the AMS Short Course, The Unreasonable Effectiveness of Number Theory, held in Orono, Maine, in August 1991. This Short Course provided some views into the great breadth of applications of number...
This book is based on the AMS Short Course, The Unreasonable Effectiveness of Number Theory, held in Orono, Maine, in August 1991. This Short Course provided some views into the great breadth of applications of number theory outside cryptology and highlighted the power and applicability of number-theoretic ideas. Because number theory is one of the most accessible areas of mathematics, this book will appeal to a general mathematical audience as well as to researchers in other areas of science and engineering who wish to learn how number theory is being applied outside of mathematics. All of the chapters are written by leading specialists in number theory and provides excellent introduction to various applications.
Probabilistic methods have become a vital tool in the arsenal of every combinatorialist. The theory of random graphs is still a prime area for the use of probabilistic methods, and, over the years, these methods have ...
Probabilistic methods have become a vital tool in the arsenal of every combinatorialist. The theory of random graphs is still a prime area for the use of probabilistic methods, and, over the years, these methods have also proved of paramount importance in many associated areas such as the design and analysis of computer algorithms. In recent years, probabilistic combinatorics has undergone revolutionary changes as the result of the appearance of some exciting new techniques such as martingale inequalities, discrete isoperimetric inequalities, Fourier analysis on groups, eigenvalue techniques, branching processes, and rapidly mixing Markov chains. The aim of this volume is to review briefly the classical results in the theory of random graphs and to present several of the important recent developments in probabilistic combinatorics, together with some applications. The first paper contains a brief introduction to the theory of random graphs. The second paper reviews explicit constructions of random-like graphs and discusses graphs having a variety of useful properties. Isoperimetric inequalities, of paramount importance in probabilistic combinatorics, are covered in the third paper. The chromatic number of random graphs is presented in the fourth paper, together with a beautiful inequality due to Janson and the important and powerful Stein-Chen method for Poisson approximation. The aim of the fifth paper is to present a number of powerful new methods for proving that a Markov chain is “rapidly mixing” and to survey various related questions, while the sixth paper looks at the same topic in a very different context. For the random walk on the cube, the convergence to the stable distribution is best analyzed through Fourier analysis; the final paper examines this topic and proceeds to several more sophisticated applications. Open problems can be found throughout each paper.
丛书名：
AMS short course lecture notes;proceedings of symposia in applied mathematics,,proceedings of symposia in applied mathematics;proceedings of symposia in applied mathematics.
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 ar...
ISBN:
(纸本)9780821801314
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.
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 mathematic...
ISBN:
(纸本)9780821800867
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.
The papers in this book, first presented at a 1986 AMS Short Course, give a brief introduction to approximation theory and some of its current areas of active research, both theoretical and applied. The first lecture ...
详细信息
ISBN:
(纸本)9780821800980
The papers in this book, first presented at a 1986 AMS Short Course, give a brief introduction to approximation theory and some of its current areas of active research, both theoretical and applied. The first lecture describes and illustrates the basic concerns of the field. Topics highlighted in the other lectures include the following: approximation in the complex domain, \(N\)-width, optimal recovery, interpolation, algorithms for approximation, and splines, with a strong emphasis on a multivariate setting for the last three topics. The book is aimed at mathematicians interested in an introduction to areas of current research and to engineers and scientists interested in exploring the field for possible applications to their own fields. The book is best understood by those with a standard first graduate course in real and complex analysis, but some of the presentations are accessible with the minimal requirements of advanced calculus and linear algebra.
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 ...
ISBN:
(纸本)0821800965;9780821800966;3619844895
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.
暂无评论