Sold out

Algorithms in Invariant Theory

German · Paperback / Softback

Description

Read more

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 other computer science will get access to the wealth of research ideas, hints for applications, outlines and details of algorithms, worked out examples, and research problems.

Product details

Authors Bernd Sturmfels
Publisher Springer, Wien
 
Languages German
Product format Paperback / Softback
Released 01.01.1993
 
EAN 9783211824450
ISBN 978-3-211-82445-0
No. of pages 197
Weight 356 g
Illustrations w. 5 figs.
Series Texts & Monographs in Symbolic Computation
Subject Natural sciences, medicine, IT, technology > Mathematics > Arithmetic, algebra

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.