Book picks similar to
Computational Topology: An Introduction by Herbert Edelsbrunner
mathematics
math
textbooks
statistics
Engineering Mathematics
K.A. Stroud - 2001
Fully revised to meet the needs of the wide range of students beginning engineering courses, this edition has an extended Foundation section including new chapters on graphs, trigonometry, binomial series and functions and a CD-ROM
Real Analysis
H.L. Royden - 1963
Dealing with measure theory and Lebesque integration, this is an introductory graduate text.
Introductory Functional Analysis with Applications
Erwin Kreyszig - 1978
With these new unabridged and inexpensive editions, Wiley hopes to extend the life of these important works by making them available to future generations of mathematicians and scientists.Currently available in the Series: Emil ArtinGeometnc Algebra R. W. CarterSimple Groups Of Lie Type Richard CourantDifferential and Integrai Calculus. Volume I Richard CourantDifferential and Integral Calculus. Volume II Richard Courant & D. HilbertMethods of Mathematical Physics, Volume I Richard Courant & D. HilbertMethods of Mathematical Physics. Volume II Harold M. S. CoxeterIntroduction to Modern Geometry. Second Edition Charles W. Curtis, Irving ReinerRepresentation Theory of Finite Groups and Associative Algebras Nelson Dunford, Jacob T. Schwartzunear Operators. Part One. General Theory Nelson Dunford. Jacob T. SchwartzLinear Operators, Part Two. Spectral Theory--Self Adjant Operators in Hilbert Space Nelson Dunford, Jacob T. SchwartzLinear Operators. Part Three. Spectral Operators Peter HenriciApplied and Computational Complex Analysis. Volume I--Power Senes-lntegrauon-Contormal Mapping-Locatvon of Zeros Peter Hilton, Yet-Chiang WuA Course in Modern Algebra Harry HochstadtIntegral Equations Erwin KreyszigIntroductory Functional Analysis with Applications P. M. PrenterSplines and Variational Methods C. L. SiegelTopics in Complex Function Theory. Volume I --Elliptic Functions and Uniformizatton Theory C. L. SiegelTopics in Complex Function Theory. Volume II --Automorphic and Abelian Integrals C. L. SiegelTopics In Complex Function Theory. Volume III --Abelian Functions & Modular Functions of Several Variables J. J. StokerDifferential Geometry
Statistics for Business & Economics
James T. McClave - 1991
Theoretical, yet applied. Statistics for Business and Economics, Eleventh Edition, gives you the best of both worlds. Using a rich array of applications from a variety of industries, McClave/Sincich/Benson clearly demonstrates how to use statistics effectively in a business environment.The book focuses on developing statistical thinking so the reader can better assess the credibility and value of inferences made from data. As consumers and future producers of statistical inferences, readers are introduced to a wide variety of data collection and analysis techniques to help them evaluate data and make informed business decisions. As with previous editions, this revision offers an abundance of applications with many new and updated exercises that draw on real business situations and recent economic events. The authors assume a background of basic algebra.
Multiple View Geometry in Computer Vision
Richard Hartley - 2000
This book covers relevant geometric principles and how to represent objects algebraically so they can be computed and applied. Recent major developments in the theory and practice of scene reconstruction are described in detail in a unified framework. Richard Hartley and Andrew Zisserman provide comprehensive background material and explain how to apply the methods and implement the algorithms. First Edition HB (2000): 0-521-62304-9
Book of Proof
Richard Hammack - 2009
It is a bridge from the computational courses (such as calculus or differential equations) that students typically encounter in their first year of college to a more abstract outlook. It lays a foundation for more theoretical courses such as topology, analysis and abstract algebra. Although it may be more meaningful to the student who has had some calculus, there is really no prerequisite other than a measure of mathematical maturity. Topics include sets, logic, counting, methods of conditional and non-conditional proof, disproof, induction, relations, functions and infinite cardinality.
Quantum Computing Since Democritus
Scott Aaronson - 2013
Full of insights, arguments and philosophical perspectives, the book covers an amazing array of topics. Beginning in antiquity with Democritus, it progresses through logic and set theory, computability and complexity theory, quantum computing, cryptography, the information content of quantum states and the interpretation of quantum mechanics. There are also extended discussions about time travel, Newcomb's Paradox, the anthropic principle and the views of Roger Penrose. Aaronson's informal style makes this fascinating book accessible to readers with scientific backgrounds, as well as students and researchers working in physics, computer science, mathematics and philosophy.
From Mathematics to Generic Programming
Alexander A. Stepanov - 2014
If you're a reasonably proficient programmer who can think logically, you have all the background you'll need. Stepanov and Rose introduce the relevant abstract algebra and number theory with exceptional clarity. They carefully explain the problems mathematicians first needed to solve, and then show how these mathematical solutions translate to generic programming and the creation of more effective and elegant code. To demonstrate the crucial role these mathematical principles play in many modern applications, the authors show how to use these results and generalized algorithms to implement a real-world public-key cryptosystem. As you read this book, you'll master the thought processes necessary for effective programming and learn how to generalize narrowly conceived algorithms to widen their usefulness without losing efficiency. You'll also gain deep insight into the value of mathematics to programming--insight that will prove invaluable no matter what programming languages and paradigms you use. You will learn aboutHow to generalize a four thousand-year-old algorithm, demonstrating indispensable lessons about clarity and efficiencyAncient paradoxes, beautiful theorems, and the productive tension between continuous and discreteA simple algorithm for finding greatest common divisor (GCD) and modern abstractions that build on itPowerful mathematical approaches to abstractionHow abstract algebra provides the idea at the heart of generic programmingAxioms, proofs, theories, and models: using mathematical techniques to organize knowledge about your algorithms and data structuresSurprising subtleties of simple programming tasks and what you can learn from themHow practical implementations can exploit theoretical knowledge
An Introduction to Formal Language and Automata
Peter Linz - 1990
The Text Was Designed To Familiarize Students With The Foundations And Principles Of Computer Science And To Strengthen The Students' Ability To Carry Out Formal And Rigorous Mathematical Arguments. In The New Fourth Edition, Author Peter Linz Has Offered A Straightforward, Uncomplicated Treatment Of Formal Languages And Automata And Avoids Excessive Mathematical Detail So That Students May Focus On And Understand The Underlying Principles. In An Effort To Further The Accessibility And Comprehension Of The Text, The Author Has Added New Illustrative Examples Throughout.
Concepts of Modern Mathematics
Ian Stewart - 1975
Based on the abstract, general style of mathematical exposition favored by research mathematicians, its goal was to teach students not just to manipulate numbers and formulas, but to grasp the underlying mathematical concepts. The result, at least at first, was a great deal of confusion among teachers, students, and parents. Since then, the negative aspects of "new math" have been eliminated and its positive elements assimilated into classroom instruction.In this charming volume, a noted English mathematician uses humor and anecdote to illuminate the concepts underlying "new math": groups, sets, subsets, topology, Boolean algebra, and more. According to Professor Stewart, an understanding of these concepts offers the best route to grasping the true nature of mathematics, in particular the power, beauty, and utility of pure mathematics. No advanced mathematical background is needed (a smattering of algebra, geometry, and trigonometry is helpful) to follow the author's lucid and thought-provoking discussions of such topics as functions, symmetry, axiomatics, counting, topology, hyperspace, linear algebra, real analysis, probability, computers, applications of modern mathematics, and much more.By the time readers have finished this book, they'll have a much clearer grasp of how modern mathematicians look at figures, functions, and formulas and how a firm grasp of the ideas underlying "new math" leads toward a genuine comprehension of the nature of mathematics itself.
Complexity: A Guided Tour
Melanie Mitchell - 2009
Based on her work at the Santa Fe Institute and drawing on its interdisciplinary strategies, Mitchell brings clarity to the workings of complexity across a broad range of biological, technological, and social phenomena, seeking out the general principles or laws that apply to all of them. Richly illustrated, Complexity: A Guided Tour--winner of the 2010 Phi Beta Kappa Book Award in Science--offers a wide-ranging overview of the ideas underlying complex systems science, the current research at the forefront of this field, and the prospects for its contribution to solving some of the most important scientific questions of our time.
Gödel's Proof
Ernest Nagel - 1958
Gödel received public recognition of his work in 1951 when he was awarded the first Albert Einstein Award for achievement in the natural sciences--perhaps the highest award of its kind in the United States. The award committee described his work in mathematical logic as "one of the greatest contributions to the sciences in recent times."However, few mathematicians of the time were equipped to understand the young scholar's complex proof. Ernest Nagel and James Newman provide a readable and accessible explanation to both scholars and non-specialists of the main ideas and broad implications of Gödel's discovery. It offers every educated person with a taste for logic and philosophy the chance to understand a previously difficult and inaccessible subject.New York University Press is proud to publish this special edition of one of its bestselling books. With a new introduction by Douglas R. Hofstadter, this book will appeal students, scholars, and professionals in the fields of mathematics, computer science, logic and philosophy, and science.
Calculus: The Classic Edition
Earl W. Swokowski - 1991
Groundbreaking in every way when first published, this book is a simple, straightforward, direct calculus text. It's popularity is directly due to its broad use of applications, the easy-to-understand writing style, and the wealth of examples and exercises which reinforce conceptualization of the subject matter. The author wrote this text with three objectives in mind. The first was to make the book more student-oriented by expanding discussions and providing more examples and figures to help clarify concepts. To further aid students, guidelines for solving problems were added in many sections of the text. The second objective was to stress the usefulness of calculus by means of modern applications of derivatives and integrals. The third objective, to make the text as accurate and error-free as possible, was accomplished by a careful examination of the exposition, combined with a thorough checking of each example and exercise.
Elementary Statistics: Picturing the World
Ron Larson - 2002
Offering an approach with a visual/graphical emphasis, this text offers a number of examples on the premise that students learn best by doing. This book features an emphasis on interpretation of results and critical thinking over calculations.
Mindstorms: Children, Computers, And Powerful Ideas
Seymour Papert - 1980
We have Mindstorms to thank for that. In this book, pioneering computer scientist Seymour Papert uses the invention of LOGO, the first child-friendly programming language, to make the case for the value of teaching children with computers. Papert argues that children are more than capable of mastering computers, and that teaching computational processes like de-bugging in the classroom can change the way we learn everything else. He also shows that schools saturated with technology can actually improve socialization and interaction among students and between students and teachers.