This book is concerned with the relations between graphs, error-correcting codes and designs, in particular how techniques of graph theory and coding theory can give information about designs. A major revision and expansion of a previous volume in this series, this account includes many examples and new results as well as improved treatments of older material. So that non-specialists will find the treatment accessible the authors have included short introductions to the three main topics. This book will be welcomed by graduate students and research mathematicians and be valuable for advanced courses in finite combinatorics.

What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gildel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.

M. Andreatta, E.Ballico, J.Wisniewski: Projective manifolds containing large linear subspaces; - F.Bardelli: Algebraic cohomology classes on some specialthreefolds; - Ch.Birkenhake, H.Lange: Norm-endomorphisms of abelian subvarieties; - C.Ciliberto, G.van der Geer: On the jacobian of ahyperplane section of a surface; - C.Ciliberto, H.Harris, M.Teixidor i Bigas: On the endomorphisms of Jac (W1d(C)) when p=1 and C has general moduli; - B. van Geemen: Projective models of Picard modular varieties; - J.Kollar, Y.Miyaoka, S.Mori: Rational curves on Fano varieties; - R. Salvati Manni: Modular forms of the fourth degree; A. Vistoli: Equivariant Grothendieck groups and equivariant Chow groups; - Trento examples; Open problems

Combinatorics is an active field of mathematical study and the British Combinatorial Conference, held biennially, aims to survey the most important developments by inviting distinguished mathematicians to lecture at the meeting. The contributions of the principal lecturers at the Seventh Conference, held in Cambridge, are published here and the topics reflect the breadth of the subject. Each author has written a broadly conceived survey, not limited to his own work, but intended for wide readership. Important aspects of the subject are emphasized so that non-specialists will find them understandable. Topics covered include graph theory, matroids, combinatorial set theory, projective geometry and combinatorial group theory. All those researching into any aspect of Combinatorics and its applications will find much in these articles of use and interest.

With one exception, these papers are original and fully refereed research articles on various applications of Category Theory to Algebraic Topology, Logic and Computer Science. The exception is an outstanding and lengthy survey paper by Joyal/Street (80 pp) on a growing subject: it gives an account of classical Tannaka duality in such a way as to be accessible to the general mathematical reader, and to provide a key for entry to more recent developments and quantum groups. No expertise in either representation theory or category theory is assumed. Topics such as the Fourier cotransform, Tannaka duality for homogeneous spaces, braided tensor categories, Yang-Baxter operators, Knot invariants and quantum groups are introduced and studies. From the Contents: P.J. Freyd: Algebraically complete categories.- J.M.E. Hyland: First steps in synthetic domain theory.- G. Janelidze, W. Tholen: How algebraic is the change-of-base functor?.- A. Joyal, R. Street: An introduction to Tannaka duality and quantum groups.- A. Joyal, M. Tierney: Strong stacks andclassifying spaces.- A. Kock: Algebras for the partial map classifier monad.- F.W. Lawvere: Intrinsic co-Heyting boundaries and the Leibniz rule in certain toposes.- S.H. Schanuel: Negative sets have Euler characteristic and dimension.-

Using data from one season of NBA games, Basketball Data Science: With Applications in R is the perfect book for anyone interested in learning and applying data analytics in basketball. Whether assessing the spatial performance of an NBA player's shots or doing an analysis of the impact of high pressure game situations on the probability of scoring, this book discusses a variety of case studies and hands-on examples using a custom R package. The codes are supplied so readers can reproduce the analyses themselves or create their own. Assuming a basic statistical knowledge, Basketball Data Science with R is suitable for students, technicians, coaches, data analysts and applied researchers. Features: * One of the first books to provide statistical and data mining methods for the growing field of analytics in basketball. * Presents tools for modelling graphs and figures to visualize the data. * Includes real world case studies and examples, such as estimations of scoring probability using the Golden State Warriors as a test case. * Provides the source code and data so readers can do their own analyses on NBA teams and players.

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.

The present volume contains papers selected for presentation at the 14th Symposium on Mathematical Foundations of Computer Science - MFCS '89 held in Porabka-Kozubnik, Poland, from August 28 to September 1, 1989. Previous MFCs proceedings have also been published in the Lecture Notes in Computer Science. This volume presents investigations and results in theoretical computer science, in particular in the following areas: logics of programs, parallel and distributed computing, deductive databases, automata and formal languages, algorithms and data structures, software specification and validity, complexity and computability theory.

These are proceedings of an International Conference on Algebraic Topology, held 28 July through 1 August, 1986, at Arcata, California. The conference served in part to mark the 25th anniversary of the journal "Topology" and 60th birthday of Edgar H. Brown. It preceded ICM 86 in Berkeley, and was conceived as a successor to the Aarhus conferences of 1978 and 1982. Some thirty papers are included in this volume, mostly at a research level. Subjects include cyclic homology, H-spaces, transformation groups, real and rational homotopy theory, acyclic manifolds, the homotopy theory of classifying spaces, instantons and loop spaces, and complex bordism.

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

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.

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