Algorithms in Invariant Theory

✍ Scribed by Bernd Sturmfels

• Publisher: Springer Vienna
• Year: 1993
• Tongue: English
• Leaves: 202
• Series: Texts & Monographs in Symbolic Computation
• Edition: 1st ed.
• Category: Library

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

✦ Table of Contents

Front Matter ....Pages i-vii
Introduction (Bernd Sturmfels)....Pages 1-23
Invariant theory of finite groups (Bernd Sturmfels)....Pages 25-75
Bracket algebra and projective geometry (Bernd Sturmfels)....Pages 77-135
Invariants of the general linear group (Bernd Sturmfels)....Pages 137-190
Back Matter ....Pages 191-199

✦ Subjects

Computer Science; Mathematical Logic and Formal Languages; Combinatorics; Symbolic and Algebraic Manipulation; Mathematical Logic and Foundations; Algebraic Geometry