This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline. Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems, making the book particularly valuable for self-study. Major topics include: Sums Recurrences Integer functions Elementary number theory Binomial coefficients Generating functions Discrete probability Asymptotic methods This second edition includes important new material about mechanical summation. In response to the widespread use of the first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of Concrete Mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. The authors want to convey not only the importance of the techniques presented, but some of the fun in learning and using them.

No descriptive material is available for this title.

Shafarevich's Basic Algebraic Geometry has been a classic and universally used introduction to the subject since its first appearance over 40 years ago. As the translator writes in a prefatory note, ``For all [advanced undergraduate and beginning graduate] students, and for the many specialists in other branches of math who need a liberal education in algebraic geometry, Shafarevich’s book is a must.'' The third edition, in addition to some minor corrections, now offers a new treatment of the Riemann--Roch theorem for curves, including a proof from first principles. Shafarevich's book is an attractive and accessible introduction to algebraic geometry, suitable for beginning students and nonspecialists, and the new edition is set to remain a popular introduction to the field.

An introduction to abstract algebraic geometry, with the only prerequisites being results from commutative algebra, which are stated as needed, and some elementary topology. More than 400 exercises distributed throughout the book offer specific examples as well as more specialised topics not treated in the main text, while three appendices present brief accounts of some areas of current research. This book can thus be used as textbook for an introductory course in algebraic geometry following a basic graduate course in algebra. Robin Hartshorne studied algebraic geometry with Oscar Zariski and David Mumford at Harvard, and with J.-P. Serre and A. Grothendieck in Paris. He is the author of "Residues and Duality", "Foundations of Projective Geometry", "Ample Subvarieties of Algebraic Varieties", and numerous research titles.