• Title: Computations in Algebraic Geometry with Macaulay 2
• Author(s) David Eisenbud, Daniel R. Grayson, Michael E. Stillman, and Bernd Sturmfels
• Publisher: Springer; 1 edition (October 25, 2001), eBook (May 13, 2004)
• Hardcover: 345 pages
• eBook: PDF Files, DVI, PostScript, etc.
• Language: English
• ISBN-10: 3540422307
• ISBN-13: 978-3540422303
• Share This:  

Book Description

This book presents algorithmic tools for algebraic geometry and experimental applications of them. It also introduces a software system in which the tools have been implemented and with which the experiments can be carried out. Macaulay 2 is a computer algebra system devoted to supporting research in algebraic geometry, commutative algebra, and their applications.

The reader of this book will encounter Macaulay 2 in the context of concrete applications and practical computations in algebraic geometry. The expositions of the algorithmic tools presented here are designed to serve as a useful guide for those wishing to bring such tools to bear on their own problems.

• N/A>

• Amazon

• Computational and Algorithmic Mathematics
• Mathematical and Computational Software
• Algebra, Abstract Algebra, and Linear Algebra
• Geometry and Topology
• Number Theory

• Computations in Algebraic Geometry with Macaulay 2 (David Eisenbud, et al.)
• The Mirror Site (1) - PDF
• Book Homepage (PDF, DVI, PostScript, Errta, etc.)

• Algorithms in Real Algebraic Geometry (Saugata Basu, et al)

  The monograph gives a self-contained detailed exposition of the algorithmic real algebraic geometry. It will be useful both for beginners and for advanced readers, who work in real algebraic geometry or apply its methods in other fields.

• Curves and Surfaces in Geometric Modeling: Theory and Algorithms

  This book offers both a theoretically unifying understanding of polynomial curves and surfaces and an effective approach to implementation. It is also an exellent introduction to geometry concepts used in computer graphics, vision, robotics, geometric modeling.

• Algorithms for Modular Elliptic Curves, 2nd Edition (J. E. Cremona)

  This book presents a thorough treatment of many algorithms concerning the arithmetic of elliptic curves, with remarks on computer implementation. An extensive set of tables is provided giving the results of the author's implementation of the algorithms.

• Computational Geometry: Methods and Applications (Jianer Chen)

  An introduction to some of the fundamental principles of computational geometry, concentrates on four major directions in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems.

• Combinatorial and Computational Geometry (Jacob E. Goodman)

  It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension.

• Convex Bodies and Algebraic Geometry: Theory of Toric Varieties

  This book is an accessible introduction to current algebraic geometry of toric varieties gives new insight into continued fractions as well as their higher-dimensional analogues, the isoperimetric problem and other questions on convex bodies.

• A Computational Introduction to Number Theory and Algebra

  This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. It covers the basics of number theory, abstract algebra and discrete probability theory.

• Algorithms and Data Structures: Apps to Graphics and Geometry

  An introductory coverage of algorithms and data structures with application to graphics and geometry aims to show a sample of the intellectual demands required by a computer science curriculum, exercises, many with solutions, are included throughout the book.