A quick guide to computing in algebraic geometry with many explicit computational examples introducing the computer algebra system Singular.

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 begin performing their own experiments.

"Presents the structure of algebras appearing in representation theory of groups and algebras with general ring theoretic methods related to representation theory. Covers affine algebraic sets and the nullstellensatz, polynomial and rational functions, projective algebraic sets. Groebner basis, dimension of algebraic sets, local theory, curves and elliptic curves, and more."

An illustration of the many uses of algebraic geometry, highlighting the more recent applications of Groebner bases and resultants. Along the way, the authors provide an introduction to some algebraic objects and techniques more advanced than typically encountered in a first course. The book is accessible to non-specialists and to readers with a diverse range of backgrounds, assuming readers know the material covered in standard undergraduate courses, including abstract algebra. But because the text is intended for beginning graduate students, it does not require graduate algebra, and in particular, does not assume that the reader is familiar with modules.

This book intends to provide material for a graduate course on computational commutative algebra and algebraic geometry, highlighting potential applications in cryptography. Also, the topics in this book could form the basis of a graduate course that acts as a segue between an introductory algebra course and the more technical topics of commutative algebra and algebraic geometry.This book contains a total of 124 exercises with detailed solutions as well as an important number of examples that illustrate definitions, theorems, and methods. This is very important for students or researchers who are not familiar with the topics discussed. Experience has shown that beginners who want to take their first steps in algebraic geometry are usually discouraged by the difficulty of the proposed exercises and the absence of detailed answers. Therefore, exercises (and their solutions) as well as examples occupy a prominent place in this course.This book is not designed as a comprehensive reference work, but rather as a selective textbook. The many exercises with detailed answers make it suitable for use in both a math or computer science course.

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.

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.