Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Algorithms in Invariant Theory, PDF eBook

Algorithms in Invariant Theory PDF

Part of the Texts & Monographs in Symbolic Computation series

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

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.

Information

Other Formats

Information

Also in the Texts & Monographs in Symbolic Computation series  |  View all