✦ LIBER ✦

Computations in algebraic geometry with Macaulay 2

✍ Scribed by Bernd Sturmfels, David Eisenbud, Daniel R. Grayson, Michael Stillman

Book ID: 127420879
Publisher: Springer
Year: 2001
Tongue: English
Weight: 1 MB
Edition: 1
Category: Library
ISBN: 3540422307

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Computing in algebraic geometry and comm

Computing in algebraic geometry and commutative algebra using Macaulay 2

✍ Michael Stillman 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 167 KB

We present recent research of Eisenbud, Fløystad, Schreyer, and others, which was discovered with the help of experimentation with Macaulay 2. In this invited, expository paper, we start by considering the exterior algebra, and the computation of Gröbner bases. We then present, in an elementary mann

Topics in classical algebraic geometry P

Topics in classical algebraic geometry Part 2

✍ Dolgachev I. 📂 Library 📅 2003 🌐 English ⚖ 80 KB

Constructions in Finite Geometry Using C

Constructions in Finite Geometry Using Computer Algebra Systems

✍ G.L. Ebert 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 271 KB

One way of using a computer algebra system to do research in finite geometry is to use the system to construct "small" order examples of various constructions, and then hope to recognize a pattern that can be generalized and eventually proven. Of course, initially one does not know if the "small" or

Computing in algebraic geometry: A quick

Computing in algebraic geometry: A quick start using SINGULAR

✍ Wolfram Decker, Christoph Lossen 📂 Library 📅 2006 🏛 Springer 🌐 English ⚖ 2 MB

This book provides a quick access to computational tools for algebraic geometry, the mathematical discipline which handles solution sets of polynomial equations. Originating from a number of intense one week schools taught by the authors, the text is designed so as to provide a step by step introdu

BIBasis, a package for reduce and Macaul

BIBasis, a package for reduce and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases

✍ M. V. Zinin 📂 Article 📅 2012 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 367 KB

[Universitext] Polyhedral and Algebraic

[Universitext] Polyhedral and Algebraic Methods in Computational Geometry || Computation of Convex Hulls

✍ Joswig, Michael; Theobald, Thorsten 📂 Article 📅 2013 🏛 Springer London 🌐 English ⚖ 264 KB

Polyhedral and Algebraic Methods in Computational Geometry provides a thorough introduction into algorithmic geometry and its applications. It presents its primary topics from the viewpoints of discrete, convex and elementary algebraic geometry. The first part of the book studies classical problems