Since the subject of Groups of Self-Equivalences was first discussed in 1958 in a paper of Barcuss and Barratt, a good deal of progress has been achieved. This is reviewed in this volume, first by a long survey article and a presentation of 17 open problems together with a bibliography of the subject, and by a further 14 original research articles.

Introduction to the Theory of Optimization in Euclidean Space is intended to provide students with a robust introduction to optimization in Euclidean space, demonstrating the theoretical aspects of the subject whilst also providing clear proofs and applications. Students are taken progressively through the development of the proofs, where they have the occasion to practice tools of differentiation (Chain rule, Taylor formula) for functions of several variables in abstract situations. Throughout this book, students will learn the necessity of referring to important results established in advanced Algebra and Analysis courses. Features Rigorous and practical, offering proofs and applications of theorems Suitable as a textbook for advanced undergraduate students on mathematics or economics courses, or as reference for graduate-level readers Introduces complex principles in a clear, illustrative fashion

The Shape of Space, Third Edition maintains the standard of excellence set by the previous editions. This lighthearted textbook covers the basic geometry and topology of two- and three-dimensional spaces-stretching students' minds as they learn to visualize new possibilities for the shape of our universe. Written by a master expositor, leading researcher in the field, and MacArthur Fellow, its informal exposition and engaging exercises appeal to an exceptionally broad audience, from liberal arts students to math undergraduate and graduate students looking for a clear intuitive understanding to supplement more formal texts, and even to laypeople seeking an entertaining self-study book to expand their understanding of space. Features of the Third Edition: Full-color figures throughout "Picture proofs" have replaced algebraic proofs Simpler handles-and-crosscaps approach to surfaces Updated discussion of cosmological applications Intuitive examples missing from many college and graduate school curricula About the Author: Jeffrey R. Weeks is a freelance geometer living in Canton, New York. With support from the U.S. National Science Foundation, the MacArthur Foundation and several science museums, his work spans pure mathematics, applications in cosmology and-closest to his heart-exposition for the general public.

Die gesammelten mathematischen und philosophischen Werke von Hans Hahn erscheinen hier in einer dreibandigen Ausgabe. Sie enthalt samtli che Veroffentlichungen von Hahn, mit Ausnahme jener, die ursprtinglich in Buchform erschienen - dazu gehoren neben dem zweibandigen Werk tiber Reelle Funktionen auch die Einfuhrung in die Elemente der hdheren Mathematik, die er gemeinsam mit Heinrich Tietze schrieb, seine An merkungen zu Bolzanos Paradoxien des Unendlichen und mehrere Kapi tel fUr E. Pascals Repertorium der hdheren Mathematik. Nicht aufge nommen wurden auch die Buchbesprechungen von Hahn, bis auf seine Besprechung von Pringsheims Vorlesungen uber Zahlen- und Funktions lehre, die einen eigenen Aufsatz tiber die Grundlagen des Zahlbegriffs darstellt. Hahn war nicht nur einer der hervorragendsten Mathematiker dieses lahrhunderts: Sein EinfluB auf die Philosophie war auch hochst bedeut sam. Das kommt in der Einleitung, die sein ehemaliger Schiiler Sir Karl Popper fUr diese Gesamtausgabe geschrieben hat, deutlich zum Ausdruck. (Diese Einleitung ist der lctzte Essay, den Sir Karl Popper verfaBte. ) Hahn schrieb ausschlieBlich auf deutsch. Wir haben seine Arbeiten in Teilgebiete zusammengefaBt (was auch auf andere Art geschehen hatte konnen) und ihnenjeweils einen englischsprachigen Kommentar vorange stellt. Diese Kommentare, die von hervorragenden Experten stammen, be schreiben Hahns Arbeiten und ihre Wirkung."

These notes present an investigation of a condition similar to Euclid's parallel axiom for subsets of finite sets. The background material to the theory of parallelisms is introduced and the author then describes the links this theory has with other topics from the whole range of combinatorial theory and permutation groups. These include network flows, perfect codes, Latin squares, block designs and multiply-transitive permutation groups, and long and detailed appendices are provided to serve as introductions to these various subjects. Many of the results are published for the first time.

This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel algorithms, algorithms on graphs, data structures and complexity of algorithms. Some of the invited papers include surveys of results in particular fields and some report original research, while all the contributed papers report original research. Most of the algorithms given are for parallel models of computation. The papers were presented at the Second International Symposium on Optimal Algorithms held in Varna, Bulgaria, in May/June 1989. The volume will be useful to researchers and students in theoretical computer science, especially in parallel computing.

The aim of this book is to teach the reader the topics in algebra which are useful in the study of computer science. In a clear, concise style, the author present the basic algebraic structures, and their applications to such topics as the finite Fourier transform, coding, complexity, and automata theory. The book can also be read profitably as a course in applied algebra for mathematics students.

This volume contains the papers presented at the Ninth International Conference on Automated Deduction (CADE-9) held May 23-26 at Argonne National Laboratory, Argonne, Illinois. The conference commemorates the twenty-fifth anniversary of the discovery of the resolution principle, which took place during the summer of 1963. The CADE conferences are a forum for reporting on research on all aspects of automated deduction, including theorem proving, logic programming, unification, deductive databases, term rewriting, ATP for non-standard logics, and program verification. All papers submitted to the conference were refereed by at least two referees, and the program committee accepted the 52 that appear here. Also included in this volume are abstracts of 21 implementations of automated deduction systems.

This volume contains the papers which were presented at the second workshop "Computer Science Logic" held in Duisburg, FRG, October 3-7, 1988. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science: e.g. in complexity, data base theory, logic programming, artificial intelligence, and concurrency. The volume should be of interest to all logicians and computer scientists working in the above fields.

TAPSOFT '89 is the Third International Joint Conference on Theory and Practice of Software Development held in Barcelona, Spain, March 13-17, 1989. The conference consisted of three parts: - Advanced Seminar on Foundations of Innovative Software Development - Colloquium on Trees in Algebra and Programming (CAAP '89) - Colloquium on Current Issues in Programming Languages (CCIPL) The TAPSOFT '89 Conference Proceedings are published in two volumes. The first volume includes the papers from CAAP plus the more theoretical ones of the invited papers. The second volume comprises the papers from CCIPL and the invited papers more relevant to current issues in programming languages.

This volume contains the proceedings of ICALP 89, held at Stresa, Italy, July 11-15, 1989. ICALP 89 is the 16th International Colloquium on Automata, Languages and Programming in a series of meetings sponsored by the European Association for Theoretical Computer Science (EATCS). It is a broadly based conference covering all aspects of theoretical computer science including topics such as computability, automata theory, formal language theory, analysis of algorithms, computational complexity, mathematical aspects of programming language definition, logic and semantics of programming languages, foundations of logic programming, theorem proving, software specification, computational geometry, data types and data structures, theory of data bases and knowledge based systems, cryptography, VLSI structures, parallel and distributed computing, models of concurrency and robotics.

Real Scientists Don't Wear Ties links science to general and popular culture and everyday life in an easy-to-understand style. When a gifted writer of science selects his best pieces published in the world's most reputable periodicals such as Nature, Discover, and MIT Technology Review, we get an eminently readable collection of his varied work in book form. That it covers all-time relevant topics like quantum physics, gravitational waves, genetic engineering, space exploration, and artificial intelligence is an added delight. Prof. Perkowitz also discusses how science can be found in medical practice, cooking, soccer, and art, and also science and science fiction in the media. On the lighter side, he reports on his efforts to teach a computer to understand poetry, explains why scientists resist dressing up, and shows that unlike many people, scientists actually enjoy math.

This volume of research papers is an outgrowth of the Manin Seminar at Moscow University, devoted to K-theory, homological algebra and algebraic geometry. The main topics discussed include additive K-theory, cyclic cohomology, mixed Hodge structures, theory of Virasoro and Neveu-Schwarz algebras.

This volume is a record of the papers presented to the fourth British Combinatorial Conference held in Aberystwyth in July 1973. Contributors from all over the world took part and the result is a very useful and up-to-date account of what is happening in the field of combinatorics. A section of problems illustrates some of the topics in need of further investigation.

This volume is the proceedings of the 3rd Workshop on the Mathematical Foundations of Programming Language Semantics held at Tulane University, New Orleans, Louisiana, April 8-10, 1987. The 1st Workshop was at Kansas State University, Manhattan, Kansas in April, 1985 (see LNCS 239), and the 2nd Workshop with a limited number of participants was at Kansas State in April, 1986. It was the intention of the organizers that the 3rd Workshop survey as many areas of the Mathematical Foundations of Programming Language Semantics as reasonably possible. The Workshop attracted 49 submitted papers, from which 28 papers were chosen for presentation. The papers ranged in subject from category theory and Lambda-calculus to the structure theory of domains and power domains, to implementation issues surrounding semantics.

This research monograph considers the subject of asymptotics from a nonstandard view point. It is intended both for classical asymptoticists - they will discover a new approach to problems very familiar to them - and for nonstandard analysts but includes topics of general interest, like the remarkable behaviour of Taylor polynomials of elementary functions. Noting that within nonstandard analysis, "small," "large," and "domain of validity of asymptotic behaviour" have a precise meaning, a nonstandard alternative to classical asymptotics is developed. Special emphasis is given to applications in numerical approximation by convergent and divergent expansions: in the latter case a clear asymptotic answer is given to the problem of optimal approximation, which is valid for a large class of functions including many special functions. The author's approach is didactical. The book opens with a large introductory chapter which can be read without much knowledge of nonstandard analysis. Here the main features of the theory are presented via concrete examples, with many numerical and graphic illustrations. N

MATLAB lost die Mathematikaufgaben der Technik und Naturwissenschaften. Dieses Buch eignet sich als Einfuhrung fur den Einsteiger in MATLAB, als begleitendes Ubungsbuch fur Horer von Mathematikvorlesungen, als Nachschlagewerk fur Dozenten und Praktiker. Es enthalt zu allen behandelten mathematischen Problemen typische mit MATLAB geloste Beispiele. Der Leser lernt so die Anwendung von MATLAB und die Interpretation der Ergebnisse. Die konkreten Beispiele beziehen sich auf Release 5.3, was jedoch keine Einschrankung fur das Erlernen von MATLAB bedeutet."

This volume contains abridged versions of most of the sectional talks and some invited lectures given at the International Conference on Fundamentals of Computation Theory held at Kazan State University, Kazan, USSR, June 22-26, 1987. The conference was the sixth in the series of FCT Conferences organized every odd year, and the first one to take place in the USSR. FCT '87 was organized by the Section of Discrete Mathematics of the Academy of Sciences in the USSR, the Moscow State University (Department of Discrete Mathematics), and the Kazan State University (Department of Theoretical Cybernetics). This volume contains selected contributions to the following fields: Mathematical Models of Computation, Synthesis and Complexity of Control Systems, Probabilistic Computations, Theory of Programming, Computer-Assisted Deduction. The volume reflects the fact that FCT '87 was organized in the USSR: A wide range of problems typical of research in Mathematical Cybernetics in the USSR is comprehensively represented.

This book is designed for use in a one semester problem-oriented course in undergraduate set theory. The combination of level and format is somewhat unusual and deserves an explanation. Normally, problem courses are offered to graduate students or selected undergraduates. I have found, however, that the experience is equally valuable to ordinary mathematics majors. I use a recent modification of R. L. Moore's famous method developed in recent years by D. W. Cohen 1]. Briefly, in this new approach, projects are assigned to groups of students each week. With all the necessary assistance from the instructor, the groups complete their projects, carefully write a short paper for their classmates, and then, in the single weekly class meeting, lecture on their results. While the em phasis is on the student, the instructor is available at every stage to assure success in the research, to explain and critique mathematical prose, and to coach the groups in clear mathematical presentation. The subject matter of set theory is peculiarly appropriate to this style of course. For much of the book the objects of study are familiar and while the theorems are significant and often deep, it is the methods and ideas that are most important. The necessity of rea soning about numbers and sets forces students to come to grips with the nature of proof, logic, and mathematics. In their research they experience the same dilemmas and uncertainties that faced the pio neers."

The generic term "graph-grammars" refers to a variety of methods for specifying (possibly infinite) sets of graphs or sets of maps. The area of graph-grammars originated in the late 60s motivated by considerations concerning pattern recognition - since then the list of areas which have interacted with the development of graph-grammars has grown quite impressively. It includes pattern recognition, software specification and development, VLSI layout schemes, data bases, lambda-calculus, analysis of concurrent systems, massively parallel computer architectures, incremental compilers, computer animation, complexity theory, developmental biology, music composition, representation of physical solids, and many others. This volume is based on the contributions presented at the third international workshop on graph-grammars and their applications, held in Warrenton, Virginia, USA in December 1986. Aiming at the best possible representation of the field not all of the papers presented at the meeting appear in this volume and some of the papers from this volume were not presented at the workshop. The volume consists of two parts: Part I presents tutorial introductions to a number of basic graph and map rewriting mechanisms. Part II contains technical contributions. This collection of papers provides the reader with an up-to-date overview of current trends in graph-grammars.