Written by two of the best-known names in categorical logic, Conceptual Mathematics is the first book to apply categories to the most elementary mathematics. It thus serves two purposes: first, to provide a key to mathematics for the general reader or beginning student; and second, to furnish an easy introduction to categories for computer scientists, logicians, physicists, and linguists who want to gain some familiarity with the categorical method without initially committing themselves to extended study.

    Wolfram lets the world see his work in A New Kind of Science, a gorgeous, 1,280-page tome more than a decade in the making. With patience, insight, and self-confidence to spare, Wolfram outlines a fundamental new way of modeling complex systems. On the frontier of complexity science since he was a boy, Wolfram is a champion of cellular automata--256 "programs" governed by simple nonmathematical rules. He points out that even the most complex equations fail to accurately model biological systems, but the simplest cellular automata can produce results straight out of nature--tree branches, stream eddies, and leopard spots, for instance. The graphics in A New Kind of Science show striking resemblance to the patterns we see in nature every day. Wolfram wrote the book in a distinct style meant to make it easy to read, even for nontechies; a basic familiarity with logic is helpful but not essential. Readers will find themselves swept away by the elegant simplicity of Wolfram's ideas and the accidental artistry of the cellular automaton models. Whether or not Wolfram's revolution ultimately gives us the keys to the universe, his new science is absolutely awe-inspiring. --Therese Littleton

    Focused on groups, rings and fields, this text gives students a firm foundation for more specialized work by emphasizing an understanding of the nature of algebraic structures. KEY TOPICS: Sets and Relations; GROUPS AND SUBGROUPS; Introduction and Examples; Binary Operations; Isomorphic Binary Structures; Groups; Subgroups; Cyclic Groups; Generators and Cayley Digraphs; PERMUTATIONS, COSETS, AND DIRECT PRODUCTS; Groups of Permutations; Orbits, Cycles, and the Alternating Groups; Cosets and the Theorem of Lagrange; Direct Products and Finitely Generated Abelian Groups; Plane Isometries; HOMOMORPHISMS AND FACTOR GROUPS; Homomorphisms; Factor Groups; Factor-Group Computations and Simple Groups; Group Action on a Set; Applications of G-Sets to Counting; RINGS AND FIELDS; Rings and Fields; Integral Domains; Fermat's and Euler's Theorems; The Field of Quotients of an Integral Domain; Rings of Polynomials; Factorization of Polynomials over a Field; Noncommutative Examples; Ordered Rings and Fields; IDEALS AND FACTOR RINGS; Homomorphisms and Factor Rings; Prime and Maximal Ideas; Gr�bner Bases for Ideals; EXTENSION FIELDS; Introduction to Extension Fields; Vector Spaces; Algebraic Extensions; Geometric Constructions; Finite Fields; ADVANCED GROUP THEORY; Isomorphism Theorems; Series of Groups; Sylow Theorems; Applications of the Sylow Theory; Free Abelian Groups; Free Groups; Group Presentations; GROUPS IN TOPOLOGY; Simplicial Complexes and Homology Groups; Computations of Homology Groups; More Homology Computations and Applications; Homological Algebra; Factorization; Unique Factorization Domains; Euclidean Domains; Gaussian Integers and Multiplicative Norms; AUTOMORPHISMS AND GALOIS THEORY; Automorphisms of Fields; The Isomorphism Extension Theorem; Splitting Fields; Separable Extensions; Totally Inseparable Extensions; Galois Theory; Illustrations of Galois Theory; Cyclotomic Extensions; Insolvability of the Quintic; Matrix Algebra MARKET: For all readers interested in abstract algebra.

    Calculus is not a prerequisite, although examples and exercises using very basic calculus are included (labeled Calculus Required.) The most technology-friendly text on the market, Introductory Linear Algebra is also the most flexible. By omitting certain sections, instructors can cover the essentials of linear algebra (including eigenvalues and eigenvectors), to show how the computer is used, and to introduce applications of linear algebra in a one-semester course.

     This top-selling, theorem-proof text presents a careful treatment of the principal topics of linear algebra, and illustrates the power of the subject through a variety of applications. It emphasizes the symbiotic relationship between linear transformations and matrices, but states theorems in the more general infinite-dimensional case where appropriate.

    It offers a comprehensive and accessible treatment of the theory of algorithms and complexity—the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. The book is self-contained in that it develops all necessary mathematical prerequisites from such diverse fields such as computability, logic, number theory and probability.

    His Contemporary Abstract Algebra, 6/e, includes challenging topics in abstract algebra as well as numerous figures, tables, photographs, charts, biographies, computer exercises, and suggested readings that give the subject a current feel and makes the content interesting and relevant for students.

    Topics covered in the book include linear equations, ratios, quadratic equations, special factorizations, complex numbers, graphing linear and quadratic equations, linear and quadratic inequalities, functions, polynomials, exponents and logarithms, absolute value, sequences and series, and much more!The text is structured to inspire the reader to explore and develop new ideas. Each section starts with problems, giving the student a chance to solve them without help before proceeding. The text then includes solutions to these problems, through which algebraic techniques are taught. Important facts and powerful problem solving approaches are highlighted throughout the text. In addition to the instructional material, the book contains well over 1000 problems.This book can serve as a complete Algebra I course, and also includes many concepts covered in Algebra II. Middle school students preparing for MATHCOUNTS, high school students preparing for the AMC, and other students seeking to master the fundamentals of algebra will find this book an instrumental part of their mathematics libraries.656About the author: Richard Rusczyk is a co-author of Art of Problem Solving, Volumes 1 and 2, the author of Art of Problem Solving's Introduction to Geometry. He was a national MATHCOUNTS participant, a USA Math Olympiad winner, and is currently director of the USA Mathematical Talent Search.

    The Fourth Edition builds on this strength with new examples, additional applications and increased cryptology coverage. Up-to-date information on the latest discoveries is included.Elementary Number Theory and Its Applications provides a diverse group of exercises, including basic exercises designed to help students develop skills, challenging exercises and computer projects. In addition to years of use and professor feedback, the fourth edition of this text has been thoroughly accuracy checked to ensure the quality of the mathematical content and the exercises.

    Polya, How to Solve It will show anyone in any field how to think straight. In lucid and appealing prose, Polya reveals how the mathematical method of demonstrating a proof or finding an unknown can be of help in attacking any problem that can be reasoned out--from building a bridge to winning a game of anagrams. Generations of readers have relished Polya's deft--indeed, brilliant--instructions on stripping away irrelevancies and going straight to the heart of the problem.

    It contains many puzzles and their solutions and aims to attract many readers in an age where computer science, logic, and mathematics are becoming increasingly important and popular.

    

    GRAPH THEORY WITH APPLICATIONS TO ENGINEERING AND COMPUTER SCIENCE-PHI-DEO, NARSINGH-1979-EDN-1

    Inside PFTB (Proofs from The Book) is indeed a glimpse of mathematical heaven, where clever insights and beautiful ideas combine in astonishing and glorious ways. There is vast wealth within its pages, one gem after another. Some of the proofs are classics, but many are new and brilliant proofs of classical results. ...Aigner and Ziegler... write: ..". all we offer is the examples that we have selected, hoping that our readers will share our enthusiasm about brilliant ideas, clever insights and wonderful observations." I do. ... " Notices of the AMS, August 1999..". the style is clear and entertaining, the level is close to elementary ... and the proofs are brilliant. ..." LMS Newsletter, January 1999This third edition offers two new chapters, on partition identities, and on card shuffling. Three proofs of Euler's most famous infinite series appear in a separate chapter. There is also a number of other improvements, such as an exciting new way to "enumerate the rationals."

    Written By Two Of Today'S Most Respected Computer Science Educators, Nell Dale And John Lewis, The Text Provides A Broad Overview Of The Many Aspects Of The Discipline From A Generic View Point. Separate Program Language Chapters Are Available As Bundle Items For Those Instructors Who Would Like To Explore A Particular Programming Language With Their Students. The Many Layers Of Computing Are Thoroughly Explained Beginning With The Information Layer, Working Through The Hardware, Programming, Operating Systems, Application, And Communication Layers, And Ending With A Discussion On The Limitations Of Computing. Perfect For Introductory Computing And Computer Science Courses, Computer Science Illuminated, Third Edition's Thorough Presentation Of Computing Systems Provides Computer Science Majors With A Solid Foundation For Further Study, And Offers Non-Majors A Comprehensive And Complete Introduction To Computing.