These notes are based on the course of lectures I gave at Harvard in the fall of 1964. They constitute a self-contained account of vector bundles and K-theory assuming only the rudiments of point-set topology and linear algebra. One of the features of the treatment is that no use is made of ordinary homology or cohomology theory. In fact, rational cohomology is defined in terms of K-theory.The theory is taken as far as the solution of the Hopf invariant problem and a start is mode on the J...

This book is designed to be read by students who have had a first elementary course in general algebra. It provides a common generalization of the primes of arithmetic and the points of geometry. The book explains the various elementary operations which can be performed on ideals.

MULTIPLY your chances of understanding DISCRETE MATHEMATICSIf you're interested in learning the fundamentals of discrete mathematics but can't seem to get your brain to function, then here's your solution. Add this easy-to-follow guide to the equation and calculate how quickly you learn the essential concepts.Written by award-winning math professor Steven Krantz, Discrete Mathematics Demystified explains this challenging topic in an effective and e...

The Nuts and Bolts of Proofs: An Introduction to Mathematical Proofs provides basic logic of mathematical proofs and shows how mathematical proofs work. It offers techniques for both reading and writing proofs. The second chapter of the book discusses the techniques in proving if/then statements by contrapositive and proofing by contradiction. It also includes the negation statement, and/or. It examines various theorems, such as the if and only-if, or equivalence theorems, the existence th...

Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of ...

This e-book is in epub3 format: it has many interactive exercises and can be read on Mac, iPad and iPhone with "ibooks", on tablet/smartphones for Android with "Gitden reader", on PCs and tablet windows and Desktop Linux with "Adobe Digital Editions".It has been designed with the intention to make it readable not only by the tablet/computer but also from smartphones with a screen size of 5 inches at least.The e-book introduces the basic elements of elementary algebra: algebra...

Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel’s inco...

This graduate-level text provides a thorough grounding in the representation theory of finite groups over fields and rings. The book provides a balanced and comprehensive account of the subject, detailing the methods needed to analyze representations that arise in many areas of mathematics. Key topics include the construction and use of character tables, the role of induction and restriction, projective and simple modules for group algebras, indecomposable representations, Brauer character...

Introducing the representation theory of groups and finite dimensional algebras, first studying basic non-commutative ring theory, this book covers the necessary background on elementary homological algebra and representations of groups up to block theory. It further discusses vertices, defect groups, Green and Brauer correspondences and Clifford theory. Whenever possible the statements are presented in a general setting for more general algebras, such as symmetric finite dimensional algeb...

Concrete Abstract Algebra develops the theory of abstract algebra from numbers to Gröbner bases, whilst taking in all the usual material of a traditional introductory course. In addition there is a rich supply of topics like cryptography, factoring algorithms for integers, quadratic residues, finite fields, factoring algorithms for polynomials and systems of non-linear equations. A special feature is that Gröbner bases do not appear as an isolated example. They are fully integrated as a su...

This book presents a graduate-level course on modern algebra. It can be used as a teaching book – owing to the copious exercises – and as a source book for those who wish to use the major theorems of algebra.The course begins with the basic combinatorial principles of algebra: posets, chain conditions, Galois connections, and dependence theories. Here, the general Jordan–Holder Theorem becomes a theorem on interval measures of certain lower semilattices. This is followed by basic c...

A First Course in Computational Algebraic Geometry is designed for young students with some background in algebra who wish to perform their first experiments in computational geometry. Originating from a course taught at the African Institute for Mathematical Sciences, the book gives a compact presentation of the basic theory, with particular emphasis on explicit computational examples using the freely available computer algebra system, Singular. Readers will quickly gain the confidence to...