Algorithms in invariant theory

Free Download

Authors:

Edition: 2nd ed

Series: Texts and monographs in symbolic computation

ISBN: 3211774165, 9783211774168, 9783211774175

Size: 1 MB (1157077 bytes)

Pages: 201/201

File format:

Language:

Publishing Year:

Category:

Bernd Sturmfels, Peter Paule3211774165, 9783211774168, 9783211774175

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.

Reviews

There are no reviews yet.

Be the first to review “Algorithms in invariant theory”
Shopping Cart
Scroll to Top