From the reviews: "... In the past, more of the leading mathematicians proposed and solved problems than today, and there were problem departments in many journals. Pólya and Szego must have combed all of the large problem literature from about 1850 to 1925 for their material, and their collection of the best in analysis is a heritage of lasting value. The work is unashamedly dated. With few exceptions, all of its material comes from before 1925. We can judge its vintage by a brief look at the author indices (combined). Let's start on the C's: Cantor, Carathéodory, Carleman, Carlson, Catalan, Cauchy, Cayley, Cesàro,... Or the L's: Lacour, Lagrange, Laguerre, Laisant, Lambert, Landau, Laplace, Lasker, Laurent, Lebesgue, Legendre,... Omission is also information: Carlitz, Erdös, Moser, etc."Bull.Americ.Math.Soc.

The book provides a comprehensive theory of ODE which come as Euler-Lagrange equations from generally higher-order Lagrangians. Emphasis is laid on applying methods from differential geometry (fibered manifolds and their jet-prolongations) and global analysis (distributions and exterior differential systems). Lagrangian and Hamiltonian dynamics, Hamilton-Jacobi theory, etc., for any Lagrangian system of any order are presented. The key idea - to build up these theories as related with the class of equivalent Lagrangians - distinguishes this book from other texts on higher-order mechanics. The reader should be familiar with elements of differential geometry, global analysis and the calculus of variations.

This book constitutes the refereed proceedings of the 7th International Workshop on Discrete Geometry for Computer Imagery, DGCI '97, held in Montpellier, France, in December 1997. The volume presents 17 revised full papers together with three invited full papers. The contributions are organized in sections on 2D recognition, discrete shapes and planes, surfaces, topology, features, and from principles to applications.

Convex and discrete geometry is one of the most intuitive subjects in mathematics. One can explain many of its problems, even the most difficult - such as the sphere-packing problem (what is the densest possible arrangement of spheres in an n-dimensional space?) and the Borsuk problem (is it possible to partition any bounded set in an n-dimensional space into n+1 subsets, each of which is strictly smaller in "extent" than the full set?) - in terms that a layman can understand; and one can reasonably make conjectures about their solutions with little training in mathematics.

This 1987 volume presents a collection of papers given at the 1985 Durham Symposium on homotopy theory. They survey recent developments in the subject including localisation and periodicity, computational complexity, and the algebraic K-theory of spaces.

This book provides a striking synthesis of the standard theory of connections in principal bundles and the Lie theory of Lie groupoids. The concept of Lie groupoid is a little-known formulation of the concept of principal bundle and corresponding to the Lie algebra of a Lie group is the concept of Lie algebroid: in principal bundle terms this is the Atiyah sequence. The author's viewpoint is that certain deep problems in connection theory are best addressed by groupoid and Lie algebroid methods. After preliminary chapters on topological groupoids, the author gives the first unified and detailed account of the theory of Lie groupoids and Lie algebroids. He then applies this theory to the cohomology of Lie algebroids, re-interpreting connection theory in cohomological terms, and giving criteria for the existence of (not necessarily Riemannian) connections with prescribed curvature form. This material, presented in the last two chapters, is work of the author published here for the first time. This book will be of interest to differential geometers working in general connection theory and to researchers in theoretical physics and other fields who make use of connection theory.

In this book, two seemingly unrelated fields -- algebraic topology and robust control -- are brought together. The book develops algebraic/differential topology from an application-oriented point of view. The book takes the reader on a path starting from a well-motivated robust stability problem, showing the relevance of the simplicial approximation theorem and how it can be efficiently implemented using computational geometry. The simplicial approximation theorem serves as a primer to more serious topological issues such as the obstruction to extending the Nyquist map, K-theory of robust stabilization, and eventually the differential topology of the Nyquist map, culminating in the explanation of the lack of continuity of the stability margin relative to rounding errors. The book is suitable for graduate students in engineering and/or applied mathematics, academic researchers and governmental laboratories.

This book constitutes the refereed proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery, DGCI'96, held in Lyon, France, in November 1996.
Computer imaging essentially depends on discrete models for coding, processing, recognition, representation, etc. The volume presents 24 revised full papers selected from 41 submissions together with 3 invited contributions and a tutorial paper, which bridges the gap between theory and practice. The issues addressed are topology, geometry, shape representation, 3D surfaces and volumes, models for discrete space, image transformation and generation.

In this monograph we give an exposition of some recent development in homotopy theory. It relates to advances in periodicity in homotopy localization and in cellular spaces. The notion of homotopy localization is treated quite generally and encompasses all the known idempotent homotopy functors. It is applied to K-theory localizations, to Morava-theories, to Hopkins-Smith theory of types. The method of homotopy colimits is used heavily. It is written with an advanced graduate student in topology and research homotopy theorist in mind.

This anthology is based on the First ACM Workshop on Applied Computational Geometry, WACG '96, held in Philadelphia, PA, USA, in May 1996, as part of the FCRC Conference.
Today, CG is in transition and applied computational geometry has established itself as a fertile meeting ground for theorists from core computational geometry and practitioners from the potential application areas to exchange their ideas and identify issues of common interest. The book presents 11 invited contributions and state-of-the-art reports by leading experts together with 12 refereed full papers selected from 32 submissions. It points the way towards geometrical engineering and addresses researchers and professionals sharing an interest in geometric algorithms and techniques and their use in computational sciences and engineering.

From Newton to Mandelbrot takes the student on a tour of the most important landmarks of theoretical physics: classical, quantum, and statistical mechanics, relativity, electrodynamics, and, the most modern and exciting of all, the physics of fractals. The treatment is confined to the essentials of each area, and short computer programs, numerous problems, and beautiful color illustrations round off this unusual textbook. Ideally suited for a one-year course in theoretical physics it will also prove useful in preparing and revising for exams. This edition is corrected and includes a new appendix on elementary particle physics, answers to all short questions, and a diskette where a selection of executable programs exploring the fractal concept can be found.

This introduction to modern geometry differs from other books in the field due to its emphasis on applications and its discussion of special relativity as a major example of a non-Euclidean geometry. Additionally, it covers the two important areas of non-Euclidean geometry, spherical geometry and projective geometry, as well as emphasising transformations, and conics and planetary orbits. Much emphasis is placed on applications throughout the book, which motivate the topics, and many additional applications are given in the exercises. It makes an excellent introduction for those who need to know how geometry is used in addition to its formal theory.

This book has been called a Workbook to make it clear from the start that it is not a conventional textbook. Conventional textbooks proceed by giving in each section or chapter first the definitions of the terms to be used, the concepts they are to work with, then some theorems involving these terms (complete with proofs) and finally some examples and exercises to test the readers' understanding of the definitions and the theorems. Readers of this book will indeed find all the conventional constituents--definitions, theorems, proofs, examples and exercises but not in the conventional arrangement. In the first part of the book will be found a quick review of the basic definitions of general topology interspersed with a large num ber of exercises, some of which are also described as theorems. (The use of the word Theorem is not intended as an indication of difficulty but of importance and usefulness. ) The exercises are deliberately not "graded"-after all the problems we meet in mathematical "real life" do not come in order of difficulty; some of them are very simple illustrative examples; others are in the nature of tutorial problems for a conven tional course, while others are quite difficult results. No solutions of the exercises, no proofs of the theorems are included in the first part of the book-this is a Workbook and readers are invited to try their hand at solving the problems and proving the theorems for themselves."

We have tried to design this book for both instructional and reference use, during and after a first course in algebraic topology aimed at users rather than developers; indeed, the book arose from such courses taught by the authors. We start gently, with numerous pictures to illustrate the fundamental ideas and constructions in homotopy theory that are needed in later chapters. A certain amount of redundancy is built in for the reader's convenience: we hope to minimize: fiipping back and forth, and we have provided some appendices for reference. The first three are concerned with background material in algebra, general topology, manifolds, geometry and bundles. Another gives tables of homo topy groups that should prove useful in computations, and the last outlines the use of a computer algebra package for exterior calculus. Our approach has been that whenever a construction from a proof is needed, we have explicitly noted and referenced this. In general, wehavenot given a proof unless it yields something useful for computations. As always, the only way to un derstand mathematics is to do it and use it. To encourage this, Ex denotes either an example or an exercise. The choice is usually up to you the reader, depending on the amount of work you wish to do; however, some are explicitly stated as ( unanswered) questions. In such cases, our implicit claim is that you will greatly benefit from at least thinking about how to answer them."

The book discusses various construction principles for translation planes and spreads from a general and unifying point of view and relates them to the theory of kinematic spaces. The book is intended for people working in the field of incidence geometry and can be read by everyone who knows the basic facts about projective and affine planes.
The methods developed work especially well for topological spreads of real and complex vector spaces. In particular, a complete classification of all semifield spreads of finite dimensional complex vector spaces is obtained.

This is a textbook written for mechanical engineering students at first-year graduate level. As such, it emphasizes the development of finite element methods used in applied mechanics. The book starts with fundamental formulations of heat conduction and linear elasticity and derives the weak form (i.e. the principle of virtual work in elasticity) from a boundary value problem that represents the mechanical behaviour of solids and fluids. Finite element approximations are then derived from this weak form. The book contains many useful exercises and the author appropriately provides the student with computer programs in both BASIC and FORTRAN for solving them. Furthermore, a workbook is available with additional computer listings, and also an accompanying disc that contains the BASIC programs for use on IBM-PC microcomputers and their compatibles. Thus the usefulness and versatility of this text is enhanced by the student's ability to practise problem solving on accessible microcomputers.

The purpose of this book is to provide an integrated development of modern analysis and topology through the integrating vehicle of uniform spaces. The reader should have taken an advanced calculus course and an introductory topology course. It is intended that a subset of the book could be used for an upper-level undergraduate course whereas much of the full text would be suitable for a one-year graduate class. An attempt has been made to document the history of all the central ideas and references and historical notes are embedded in the text. These can lead the interested reader to the foundational sources where these ideas emerged.

This book is a study of combinatorial structures of 3-mani- folds, especially Haken 3-manifolds. Specifically, it is concerned with Heegard graphs in Haken 3-manifolds, i.e., with graphs whose complements have a free fundamental group. These graphs always exist. They fix not only a combinatorial stucture but also a presentation for the fundamental group of the underlying 3-manifold. The starting point of the book is the result that the intersection of Heegard graphs with incompressible surfaces, or hierarchies of such surfaces, is very rigid. A number of finiteness results lead up to a ri- gidity theorem for Heegard graphs. The book is intended for graduate students and researchers in low-dimensional topolo- gy as well as combinatorial theory. It is self-contained and requires only a basic knowledge of the theory of 3-manifolds

This book is devoted to the development of adequate spatial representations for robot motion planning. Drawing upon advanced heuristic techniques from AI and computational geometry, the authors introduce a general model for spatial representation of physical objects. This model is then applied to two key problems in intelligent robotics: collision detection and motion planning. In addition, the application to actual robot arms is kept always in mind, instead of dealing with simplified models.
This monograph is built upon Angel del Pobil's PhD thesis which was selected as the winner of the 1992 Award of the Spanish Royal Academy of Doctors.

This book constitutes the refereed proceedings of the international Symposium on Graph Drawing, GD '95, held in Passau, Germany, in September 1995.
The 40 full papers and 12 system demonstrations were selected from a total of 88 submissions and include, in their revised versions presented here, the improvements suggested during the meeting. This book also contains a report on the graph-drawing contest held in conjunction with GD '95. Graph drawing is concerned with the problem of visualizing structural information, particularly by constructing geometric representations of abstract graphs and networks. The importance of this area for industrial applications is testified by the large number of people with industrial affiliations, submitting papers and participating in the meeting.

In this short book, the authors discuss three types of problems from combinatorial geometry: Borsuk's partition problem, covering convex bodies by smaller homothetic bodies, and the illumination problem. They show how closely related these problems are to each other. The presentation is elementary, with no more than high-school mathematics and an interest in geometry required to follow the arguments. Most of the discussion is restricted to two- and three-dimensional Euclidean space, though sometimes more general results and problems are given. Thus even the mathematically unsophisticated reader can grasp some of the results of a branch of twentieth-century mathematics that has applications in such disciplines as mathematical programming, operations research and theoretical computer science. At the end of the book the authors have collected together a set of unsolved and partially solved problems that a sixth-form student should be able to understand and even attempt to solve.

The aim of this book, which was originally published in 1985, is to cover from first principles the theory of Syzygies, building up from a discussion of the basic commutative algebra to such results as the authors' proof of the Syzygy Theorem. In the last three chapters applications of the theory to commutative algebra and algebraic geometry are given.

This monograph is devoted to computational morphology, particularly to the construction of a two-dimensional or a three-dimensional closed object boundary through a set of points in arbitrary position.
By applying techniques from computational geometry and CAGD, new results are developed in four stages of the construction process: (a) the gamma-neighborhood graph for describing the structure of a set of points; (b) an algorithm for constructing a polygonal or polyhedral boundary (based on (a)); (c) the flintstone scheme as a hierarchy for polygonal and polyhedral approximation and localization; (d) and a Bezier-triangle based scheme for the construction of a smooth piecewise cubic boundary.

In this volume, which is dedicated to H. Seifert, are papers based on talks given at the Isle of Thorns conference on low dimensional topology held in 1982.

This book introduces the graduate mathematician and researcher to the effective use of nonstandard analysis (NSA). It provides a tutorial introduction to this modern theory of infinitesimals, followed by nine examples of applications, including complex analysis, stochastic differential equations, differential geometry, topology, probability, integration, and asymptotics. It ends with remarks on teaching with infinitesimals.