Applications of Computational Algebraic Geometry
About this Title
David A. Cox, Amherst College, Amherst, MA and Bernd Sturmfels, University of California, Berkeley, Berkeley, CA, Editors
Publication: Proceedings of Symposia in Applied Mathematics
Publication Year: 1998; Volume 53
ISBNs: 978-0-8218-0750-7 (print); 978-0-8218-9268-8 (online)
This book introduces readers to key ideas and applications of computational algebraic geometry. Beginning with the discovery of Gröbner bases and fueled by the advent of modern computers and the rediscovery of resultants, computational algebraic geometry has grown rapidly in importance. The fact that “crunching equations” is now as easy as “crunching numbers” has had a profound impact in recent years. At the same time, the mathematics used in computational algebraic geometry is unusually elegant and accessible, which makes the subject easy to learn and easy to apply.
This book begins with an introduction to Gröbner bases and resultants, then discusses some of the more recent methods for solving systems of polynomial equations. A sampler of possible applications follows, including computer-aided geometric design, complex information systems, integer programming, and algebraic coding theory. The lectures in the book assume no previous acquaintance with the material.
Graduate students and research mathematicians interested in commutative rings and algebras.
Table of Contents
- David A. Cox – Introduction to Gröbner bases [MR 1602343]
- Bernd Sturmfels – Introduction to resultants [MR 1602347]
- Dinesh Manocha – Numerical methods for solving polynomial equations [MR 1602351]
- Thomas W. Sederberg – Applications to computer aided geometric design [MR 1602355]
- Xenia H. Kramer and Reinhard C. Laubenbacher – Combinatorial homotopy of simplicial complexes and complex information systems [MR 1602359]
- Rekha R. Thomas – Applications to integer programming [MR 1602363]
- John B. Little – Applications to coding theory [MR 1602367]