Algorithms in Invariant Theory : Texts & Monographs in Symbolic Computation - Peter Paule

Algorithms in Invariant Theory

By: Peter Paule, Bernd Sturmfels

Paperback | 28 April 2008 | Edition Number 2

At a Glance

Paperback


$273.07

or 4 interest-free payments of $68.27 with

 or 

Aims to ship in 7 to 10 business days

When will this arrive by?
Enter delivery postcode to estimate

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.

More in Mathematical Logic

The Language of Mathematics : The Stories behind the Symbols - Raul Rojas
The Univalence Principle - Benedikt Ahrens

RRP $219.00

$197.25

10%
OFF
Partial Truths : How Fractions Distort Our Thinking - James C. Zimring
Polygraphs : From Rewriting to Higher Categories - Albert  Burroni
Mathematical Intelligence : What We Have that Machines Don't - Junaid Mubeen