Algorithms in Invariant Theory

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...

Full description

Saved in:
Bibliographic Details
Main Author Sturmfels, Bernd
Format eBook
LanguageEnglish
Published Vienna Springer Verlag, Wien 2008
Springer Wien
Springer Vienna
Springer
Edition2. Aufl.
SeriesTexts and Monographs in Symbolic Computation
Subjects
Algebraic Geometry
Artificial Intelligence
Combinatorics
Computer Science
Invariants
Mathematical Logic and Formal Languages
Mathematical Logic and Foundations
Symbolic and Algebraic Manipulation
Wissen Mathematik
Technik
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9783211774168
3211774165
ISSN:0943-853X
DOI:10.1007/978-3-211-77417-5