This book presents algorithmic tools for algebraic geometry, with experimental applications. It also introduces Macaulay 2, a computer algebra system supporting research in algebraic geometry, commutative algebra, and their applications. The algorithmic tools presented here are designed to serve readers wishing to bring such tools to bear on their own problems. The first part of the book covers Macaulay 2 using concrete applications; the second emphasizes details of the mathematics.

This book presents algorithmic tools for algebraic geometry, with experimental applications. It also introduces Macaulay 2, a computer algebra system supporting research in algebraic geometry, commutative algebra, and their applications. The algorithmic tools presented here are designed to serve readers wishing to bring such tools to bear on their own problems. The first part of the book covers Macaulay 2 using concrete applications; the second emphasizes details of the mathematics.

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 introduction which enables the reader to get started with his own computational experiments right away. The authors present the basic concepts and ideas in a compact way.

The interplay between algebra and geometry is a beautiful (and fun!) area of mathematical investigation. Advances in computing and algorithms make it possible to tackle many classical problems in a down-to-earth and concrete fashion. This opens wonderful new vistas and allows us to pose, study and solve problems that were previously out of reach. Suitable for graduate students, the objective of this 2003 book is to bring advanced algebra to life with lots of examples. The first chapters provide an introduction to commutative algebra and connections to geometry. The rest of the book focuses on three active areas of contemporary algebra: Homological Algebra (the snake lemma, long exact sequence inhomology, functors and derived functors (Tor and Ext), and double complexes); Algebraic Combinatorics and Algebraic Topology (simplicial complexes and simplicial homology, Stanley-Reisner rings, upper bound theorem and polytopes); and Algebraic Geometry (points and curves in projective space, Riemann-Roch, Cech cohomology, regularity).

This ACM volume deals with tackling problems that can be represented by data structures which are essentially matrices with polynomial entries, mediated by the disciplines of commutative algebra and algebraic geometry. The discoveries stem from an interdisciplinary branch of research which has been growing steadily over the past decade. The author covers a wide range, from showing how to obtain deep heuristics in a computation of a ring, a module or a morphism, to developing means of solving nonlinear systems of equations - highlighting the use of advanced techniques to bring down the cost of computation. Although intended for advanced students and researchers with interests both in algebra and computation, many parts may be read by anyone with a basic abstract algebra course.

This book can be understood as a model for teaching commutative algebra, and takes into account modern developments such as algorithmic and computational aspects. As soon as a new concept is introduced, the authors show how the concept can be worked on using a computer. The computations are exemplified with the computer algebra system Singular, developed by the authors. Singular is a special system for polynomial computation with many features for global as well as for local commutative algebra and algebraic geometry. The book includes a CD containing Singular as well as the examples and procedures explained in the book.

This book constitutes the refereed proceedings of the 10th International Workshop on Computer Algebra in Scientific Computing, CASC 2007, held in Bonn, Germany, in September 2007. The volume is dedicated to Professor Vladimir P. Gerdt on the occasion of his 60th birthday. The 35 revised full papers presented were carefully reviewed and selected from numerous submissions for inclusion in the book. The papers cover not only various expanding applications of computer algebra to scientific computing but also the computer algebra systems themselves and the CA algorithms. Topics addressed are studies in polynomial and matrix algebra, quantifier elimination, and Gröbner bases, as well as stability investigation of both differential equations and difference methods for them. Several papers are devoted to the application of computer algebra methods and algorithms to the derivation of new mathematical models in biology and in mathematical physics.

The discovery of new algorithms for dealing with polynomial equations, and their implementation on fast, inexpensive computers, has revolutionized algebraic geometry and led to exciting new applications in the field. This book details many uses of algebraic geometry and highlights recent applications of Grobner bases and resultants. This edition contains two new sections, a new chapter, updated references and many minor improvements throughout.

* The main treatment is devoted to the analysis of systems of linear partial differential equations (PDEs) with constant coefficients, focusing attention on null solutions of Dirac systems * All the necessary classical material is initially presented * Geared toward graduate students and researchers in (hyper)complex analysis, Clifford analysis, systems of PDEs with constant coefficients, and mathematical physics

The advent of mathematical software has been one of the most important events in mathematics. Mathematical software systems are used to construct examples, to prove theorems, and to find new mathematical phenomena. On the other hand, mathematical research often motivates developments of new algorithms and new systems.This volume contains the papers presented at the First International Congress of Mathematical Software, which aimed at a coherent study of mathematical software systems from a wide variety of branches of mathematics. The book discusses more than one hundred mathematical software systems. Readers can get an overview of the current status of the arts of mathematical software and algorithms.The proceedings have been selected for coverage in: • Index to Scientific & Technical Proceedings (ISTP CDROM version / ISI Proceedings)