We live in a world that is not quite "right." The central tenet of statistical inquiry is that Observation = Truth + Error because even the most careful of scientific investigations have always been bedeviled by uncertainty. Our attempts to measure things are plagued with small errors. Our attempts to understand our world are blocked by blunders. And, unfortunately, in some cases, people have been known to lie. In this long-awaited follow-up to his well-regarded bestseller, The Lady Tasting Tea, David Salsburg opens a door to the amazing widespread use of statistical methods by looking at historical examples of errors, blunders and lies from areas as diverse as archeology, law, economics, medicine, psychology, sociology, Biblical studies, history, and war-time espionage. In doing so, he shows how, upon closer statistical investigation, errors and blunders often lead to useful information. And how statistical methods have been used to uncover falsified data. Beginning with Edmund Halley's examination of the Transit of Venus and ending with a discussion of how many tanks Rommel had during the Second World War, the author invites the reader to come along on this easily accessible and fascinating journey of how to identify the nature of errors, minimize the effects of blunders, and figure out who the liars are.

Master math at your own pace
Does working with numbers often frustrate you? Do you need to brush up on your basic math skills? Do you feel math stands between you and your career goals, or a better grade at school?
Quick Arithmetic, Third Edition is the quickest and easiest way to teach yourself the basic math skills you need to advance on the job or in school. Using cartoons and a clear writing style, this practical guide provides a fresh start for learning or reviewing how to work with whole numbers, fractions, decimals, and percentages. The book's proven self-teaching approach allows you to work at your own pace and learn only the material you need. Previews and objectives at the beginning of each section help you determine your particular needs, while self-tests, practice problems, and a final exam let you measure your progress and reinforce what you've learned.
For anyone who has ever felt intimidated by a page of numbers, Quick Arithmetic, Third Edition has the answers

This collection of surveys and research papers on recent topics of interest in combinatorics is dedicated to Paul Erdös, who attended the conference and who is represented by two articles in the collection, including one, unfinished, which he was writing on the eve of his sudden death. Erdös was one of the greatest mathematicians of his century and often the subject of anecdotes about his somewhat unusual lifestyle. A new preface, written by friends and colleagues, gives a flavor of his life, including many such stories, and also describes the broad outline and importance of his work in combinatorics and other related fields.

This book is intended as a reference for mathematicians working with homological dimensions in commutative algebra and as an introduction to Gorenstein dimensions for graduate students with an interest in the same. Any admirer of classics like the Auslander-Buchsbaum-Serre characterization of regular rings, and the Bass and Auslander-Buchsbaum formulas for injective and projective dimension of f.g. modules will be intrigued by this book's content.
Readers should be well-versed in commutative algebra and standard applications of homological methods. The framework is that of complexes, but all major results are restated for modules in traditional notation, and an appendix makes the proofs accessible for even the casual user of hyperhomological methods.

Logik ist uberall: im vernunftgemassen Urteil, in der Einsicht, die den Glauben erganzt, in Sprache und Mathematik, in einer aufgeklarten Ethik und in der Frage nach der Wahrheit und den Grenzen des Wissens. Sie scheint unverzichtbar, selbstverstandlich und immer schon da gewesen zu sein, solange Menschen denken. Doch auch die Logik musste erst geschaffen werden - auch sie blickt, wie alle klassischen Wissenschaften, auf ein funfundzwanzig Jahrhunderte wahrendes Entstehen zuruck, und viele der groessten Geister haben an ihr gebaut. Davon berichtet dieses Buch.

A self-contained introduction is given to J. Rickard's Morita theory for derived module categories and its recent applications in representation theory of finite groups. In particular, Brou 's conjecture is discussed, giving a structural explanation for relations between the p-modular character table of a finite group and that of its "p-local structure." The book is addressed to researchers or graduate students and can serve as material for a seminar. It surveys the current state of the field, and it also provides a "user's guide" to derived equivalences and tilting complexes. Results and proofs are presented in the generality needed for group theoretic applications.

The mathematical theory of ondelettes (wavelets) was developed by Yves Meyer and many collaborators about 10 years ago. It was designed for ap proximation of possibly irregular functions and surfaces and was successfully applied in data compression, turbulence analysis, image and signal process ing. Five years ago wavelet theory progressively appeared to be a power ful framework for nonparametric statistical problems. Efficient computa tional implementations are beginning to surface in this second lustrum of the nineties. This book brings together these three main streams of wavelet theory. It presents the theory, discusses approximations and gives a variety of statistical applications. It is the aim of this text to introduce the novice in this field into the various aspects of wavelets. Wavelets require a highly interactive computing interface. We present therefore all applications with software code from an interactive statistical computing environment. Readers interested in theory and construction of wavelets will find here in a condensed form results that are somewhat scattered around in the research literature. A practioner will be able to use wavelets via the available software code. We hope therefore to address both theory and practice with this book and thus help to construct bridges between the different groups of scientists. This te. xt grew out of a French-German cooperation (Seminaire Paris Berlin, Seminar Berlin-Paris). This seminar brings together theoretical and applied statisticians from Berlin and Paris. This work originates in the first of these seminars organized in Garchy, Burgundy in 1994."

People have always been interested in numbers, in particular the natural numbers. Of course, we all have an intuitive notion of what these numbers are. In the late 19th century mathematicians, such as Grassmann, Frege and Dedekind, gave definitions for these familiar objects. Since then the development of axiomatic schemes for arithmetic have played a fundamental role in a logical understanding of mathematics. There has been a need for some time for a monograph on the metamathematics of first-order arithmetic. The aim of the book by Hajek and Pudlak is to cover some of the most important results in the study of a first order theory of the natural numbers, called Peano arithmetic and its fragments (subtheories). The field is quite active, but only a small part of the results has been covered in monographs. This book is divided into three parts. In Part A, the authors develop parts of mathematics and logic in various fragments. Part B is devoted to incompleteness. Part C studies systems that have the induction schema restricted to bounded formulas (Bounded Arithmetic). One highlight of this section is the relation of provability to computational complexity. The study of formal systems for arithmetic is a prerequisite for understanding results such as Godel's theorems. This book is intended for those who want to learn more about such systems and who want to follow current research in the field. The book contains a bibliography of approximately 1000 items."

This book is a companion to A general topology workbook published by Birkhiiuser last year. In an ideal world the order of publication would have been reversed, for the notation and some of the results of the present book are used in the topology book and on the other hand (the reader may be assured) no topology is used here. Both books share the word Workbook in their titles. They are based on the principle that for at least some branches of mathematics a good way for a student to learn is to be presented with a clear statement of the definitions of the terms with which the subject is concerned and then to be faced with a collection of problems involving the terms just defined. In adopting this approach with my Dundee students of set theory and general topology I found it best not to differentiate too precisely between simple illustrative examples, easy exercises and results which in conventional textbooks would be labelled as Theorems.

Ideal spaces are a very general class of normed spaces of measurable functions, which includes e.g. Lebesgue and Orlicz spaces. Their most important application is in functional analysis in the theory of (usual and partial) integral and integro-differential equations. The book is a rather complete and self-contained introduction into the general theory of ideal spaces. Some emphasis is put on spaces of vector-valued functions and on the constructive viewpoint of the theory (without the axiom of choice). The reader should have basic knowledge in functional analysis and measure theory.

This book provides a definition of Green functors for a finite group G, and of modules over it, in terms of the category of finite G-sets. Some classical constructions, such as the associated categroy or algebra, have a natural interpretation in that framework. Many notions of ring theory can be extended to Green functors (opposite Green functor, bimodules, Morita theory, simple modules, centres, ...). There are moreover connections between Green functors for different groups, given by functors associated to bisets. Intended for researchers and students in representation theory of finite groups it requires only basic algebra and category theory, though knowledge of the classical examples of Mackey functors is probably preferable

Our much-valued mathematical knowledge rests on two supports: the logic of proof and the axioms from which those proofs begin. Naturalism in Mathematics investigates the status of the latter, the fundamental assumptions of mathematics. These were once held to be self-evident, but progress in work on the foundations of mathematics, especially in set theory, has rendered that comforting notion obsolete. Given that candidates for axiomatic status cannot be proved, what sorts of considerations can be offered for or against them? That is the central question addressed in this book. One answer is that mathematics aims to describe an objective world of mathematical objects, and that axiom candidates should be judged by their truth or falsity in that world. This promising view-realism-is assessed and finally rejected in favour of another-naturalism-which attends less to metaphysical considerations of objective truth and falsity, and more to practical considerations drawn from within mathematics itself. Penelope Maddy defines this naturalism, explains the motivation for it, and shows how it can be helpfully applied in the assessment of candidates for axiomatic status in set theory. Maddy's clear, original treatment of this fundamental issue is informed by current work in both philosophy and mathematics, and will be accessible and enlightening to readers from both disciplines.

Michael Powell is one of the world's foremost figures in numerical analysis. This volume is derived from invited talks given at a meeting celebrating his 60th birthday and, reflecting Powell's own achievements, focuses on innovative work in optimization and in approximation theory. The individual papers have been written by leading authorities in their subjects and are a mix of expository articles and surveys on new work. They have all been reviewed and edited to form a volume that represents the state of the art in an important discipline within mathematics, with highly relevant applications throughout science and engineering.

This book constitutes the refereed proceedings of the 7th International Conference on Category Theory and Computer Science, CTCS'97, held in Santa Margheria Ligure, Italy, in September 1997.
Category theory attracts interest in the theoretical computer science community because of its ability to establish connections between different areas in computer science and mathematics and to provide a few generic principles for organizing mathematical theories. This book presents a selection of 15 revised full papers together with three invited contributions. The topics addressed include reasoning principles for types, rewriting, program semantics, and structuring of logical systems.

The aim of this book is to present the mathematics underlying elementary statistical methods in as simple a manner as possible. These methods include independent and paired sample t-tests, analysis of variance, regression, and the analysis of covariance. The author's principle tool is the use of geometric ideas to provide more visual insight and to make the theory accessible to a wider audience than is usually possible.

Contents: H. de Nivelle: Resolution Games and Non-Liftable Resolution Orderings. - M. Kerber, M. Kohlhase: A Tableau Calculus for Partial Functions. - G. Salzer: MUltlog: an Expert System for Multiple-valued Logics. - J. Krajic ek: A Fundamental Problem of Mathematical Logic. - P. Pudlak: On the Lengths of Proofs of Consistency. - A. Carbone: The Craig Interpolation Theorem for Schematic Systems. - I.A. Stewart: The Role of Monotonicity in Descriptive Complexity Theory. - R. Freund, L. Staiger: Numbers Defined by Turing Machines."

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 first part of this text covers the main graph theoretic topics: connectivity, trees, traversability, planarity, colouring, covering, matching, digraphs, networks, matrices of a graph, graph theoretic algorithms, and matroids. These concepts are then applied in the second part to problems in engineering, operations research, and science as well as to an interesting set of miscellaneous problems, thus illustrating their broad applicability. Every effort has been made to present applications that use not merely the notation and terminology of graph theory, but also its actual mathematical results. Some of the applications, such as in molecular evolution, facilities layout, and graffic network design, have never appeared before in book form. Written at an advanced undergraduate to beginning graduate level, this book is suitable for students of mathematics, engineering, operations research, computer science, and physical sciences as well as for researchers and practitioners with an interest in graph theoretic modelling.

Contents: P. Vihan: The Last Month of Gerhard Gentzen in Prague. - F.A. Rodriguez-Consuegra: Some Issues on Godel s Unpublished Philosophical Manuscripts. - D.D. Spalt: Vollstandigkeit als Ziel historischer Explikation. Eine Fallstudie. - E. Engeler: Existenz und Negation in Mathematik und Logik. - W.J. Gutjahr: Paradoxien der Prognose und der Evaluation: Eine fixpunkttheoretische Analyse. - R. Hahnle: Automated Deduction and Integer Programming. - M. Baaz, A. Leitsch: Methods of Functional Extension."

Selected Topics in Approximation and Computation addresses the relationship between modern approximation theory and computational methods. The text is a combination of expositions of basic classical methods of approximation leading to popular splines and new explicit tools of computation, including Sinc methods, elliptic function methods, and positive operator approximation methods. It also provides an excellent summary of worst case analysis in information based complexity. It relates optimal computational methods with the theory of s-numbers and n-widths. It can serve as a text for senior-graduate courses in computer science and applied mathematics, and also as a reference for professionals.

Die auf drei Bande angelegte Reihe mit prufungsrelevanten Aufgaben und Losungen erlautert grundlegende Mathematik-bezogene Methoden der Informatik. Der vorliegende erste Band "Induktives Vorgehen" intoniert das durch das Zusammenspiel von Struktur, Invarianz und Abstraktion gepragte Leitthema der Trilogie zu den "Grundlagen der Hoheren Informatik." Die beide Folgebande "Algebraisches Denken" und " Perfektes Modellieren" greifen dieses Thema dann variierend und in immer komplexer werdenden Zusammenhangen vertiefend auf. Wie beim Bolero von Ravel, wo die gleiche Melodie von immer mehr Musikern mit immer mehr Instrumenten gespielt wird, soll dies dazu fuhren, dass der Leser das Leitthema derart verinnerlicht, dass er es selbst an ungewohnter Stelle wiedererkennen und eigenstandig auf neue Szenarien ubertragen kann. Damit hat er beste Voraussetzungen fur das weitere Informatikstudium und eine erfolgreiche berufliche Zukunft, sei es in Wissenschaft, Management oder Industrie."

? DoesP=NP. In just ?ve symbols Dick Karp -in 1972-captured one of the deepest and most important questions of all time. When he ?rst wrote his famous paper, I think it's fair to say he did not know the depth and importance of his question. Now over three decades later, we know P=NP is central to our understanding of compu- tion, it is a very hard problem, and its resolution will have potentially tremendous consequences. This book is a collection of some of the most popular posts from my blog- Godel ] Lost Letter andP=NP-which I started in early 2009. The main thrust of the blog, especially when I started, was to explore various aspects of computational complexity around the famousP=NP question. As I published posts I branched out and covered additional material, sometimes a timely event, sometimes a fun idea, sometimes a new result, and sometimes an old result. I have always tried to make the posts readable by a wide audience, and I believe I have succeeded in doing this."

This volume contains all the papers that were presented at the Fourth Workshop on Algorithmic Learning Theory, held in Tokyo in November 1993. In addition to 3 invited papers, 29 papers were selected from 47 submitted extended abstracts. The workshop was the fourth in a series of ALT workshops, whose focus is on theories of machine learning and the application of such theories to real-world learning problems. The ALT workshops have been held annually since 1990, sponsored by the Japanese Society for Artificial Intelligence. The volume is organized into parts on inductive logic and inference, inductive inference, approximate learning, query learning, explanation-based learning, and new learning paradigms.