Power Search
Low Price Guarantee
We Take School POs
Algorithms in Invariant Theory
Contributor(s): Sturmfels, Bernd (Author), Paule, Peter (Editor)

View larger image

 ISBN: 3211774165     ISBN-13: 9783211774168
Publisher: Springer
OUR PRICE: $151.99  

Binding Type: Paperback
Published: April 2008
Qty:

Click for more in this series: Texts and Monographs in Symbolic Computation
Additional Information
BISAC Categories:
- Mathematics | Logic
- Computers | Computer Science
- Computers | Intelligence (ai) & Semantics
Dewey: 512.944
LCCN: 2007941496
Series: Texts and Monographs in Symbolic Computation
Physical Information: 0.3" H x 6.5" W x 9.3" L (0.90 lbs) 197 pages
Features: Bibliography, Illustrated, Index, Table of Contents
 
Descriptions, Reviews, Etc.
Publisher Description:
J. Kung and G.-C. Rota, in their 1984 paper, write: "Like the Arabian phoenix rising out of its ashes, the theory of invariants, pronounced dead at the turn of the century, is once again at the forefront of mathematics". The book of Sturmfels is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. The Groebner bases method is the main tool by which the central problems in invariant theory become amenable to algorithmic solutions. Students will find the book an easy introduction to this "classical and new" area of mathematics. Researchers in mathematics, symbolic computation, and computer science will get access to a wealth of research ideas, hints for applications, outlines and details of algorithms, worked out examples, and research problems.
 
Customer ReviewsSubmit your own review
 
To tell a friend about this book, you must Sign In First!