Algorithms in Invariant Theory

Algorithms in Invariant Theory - Texts & Monographs in Symbolic Computation

2nd Edition 2008

Paperback (28 Apr 2008)

  • $161.44
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7 days

Publisher's Synopsis

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.

Book information

ISBN: 9783211774168
Publisher: Springer Vienna
Imprint: Springer
Pub date:
Edition: 2nd Edition 2008
Language: English
Number of pages: 197
Weight: 354g
Height: 244mm
Width: 171mm
Spine width: 11mm