It is not a large overstatement to claim that mathematics has traditionally arisen from attempts to understand quite concrete events in the physical world.
From the reviews: "e;Bela Bollobas introductory course on graph theory deserves to be considered as a watershed in the development of this theory as a serious academic subject.
These are the proceedings of the conference "e;Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics"e; held at the Department of Mathematics, University of Florida, Gainesville, from November 11 to 13, 1999.
The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota.
Intended for first- or second-year undergraduates, this introduction to discrete mathematics covers the usual topics of such a course, but applies constructivist principles that promote - indeed, require - active participation by the student.
The aim of this book is to provide an introduction for students and nonspecialists to a fascinating relation between combinatorial geometry and algebraic geometry, as it has developed during the last two decades.
Algorithms for Games aims to provide a concrete example of the programming of a two-person game with complete information, and to demonstrate some of the methods of solutions; to show the reader that it is profitable not to fear a search, but rather to undertake it in a rational fashion, make a proper estimate of the dimensions of the "e;catastrophe"e;, and use all suitable means to keep it down to a reasonable size.
Two of the most exciting topics of current research in stochastic networks are the complementary subjects of stability and rare events - roughly, the former deals with the typical behavior of networks, and the latter with significant atypical behavior.
In April of 1996 an array of mathematicians converged on Cambridge, Massachusetts, for the Rotafest and Umbral Calculus Workshop, two con- ferences celebrating Gian-Carlo Rota's 64th birthday.
Combinatory logic started as a programme in the foundation of mathematics and in an historical context at a time when such endeavours attracted the most gifted among the mathematicians.
Mathematical Foundations of Computer Science, Volume I is the first of two volumes presenting topics from mathematics (mostly discrete mathematics) which have proven relevant and useful to computer science.
[UPDATED 6/6/2000] Group actions on trees furnish a unified geometric way of recasting the chapter of combinatorial group theory dealing with free groups, amalgams, and HNN extensions.
This volume contains papers which are based primarily on talks given at an inter- national conference on Algorithmic Problems in Groups and Semigroups held at the University of Nebraska-Lincoln from May ll-May 16, 1998.
This IMA Volume in Mathematics and its Applications TOPOLOGY AND GEOMETRY IN POLYMER SCIENCE is based on the proceedings of a very successful one-week workshop with the same title.
Goals of the Book Overthelast thirty yearsthere has been arevolutionindiagnostic radiology as a result oftheemergenceofcomputerized tomography (CT), which is the process of obtaining the density distribution within the human body from multiple x-ray projections.
This IMA Volume in Mathematics and its Applications GRID GENERATION AND ADAPTIVE ALGORITHMS is based on the proceedings of a workshop with the same title.
This IMA Volume in Mathematics and its Applications ALGORITHMS FOR PARALLEL PROCESSING is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "e;MATHEMATICS IN HIGH-PERFORMANCE COMPUTING.
The articles collected in this volume represent the contributions presented at the IMA workshop on "e;Dynamics of Algorithms"e; which took place in November 1997.
The articles in this volume present the state of the art in a variety of areas of discrete probability, including random walks on finite and infinite graphs, random trees, renewal sequences, Stein's method for normal approximation and Kohonen-type self-organizing maps.
The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole.
