Algorithms in Invariant Theory

1. Front Matter

   Pages I-VII

   PDF

2. Introduction

   Pages 1-23

3. Invariant theory of finite groups

   Pages 25-75

4. Bracket algebra and projective geometry

   Pages 77-135

5. Invariants of the general linear group

   Pages 137-190

6. Back Matter

   Pages 191-197

   PDF

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.

• Finite
• Invariant
• Invariant Theory
• algebra
• algorithms
• computer
• computer science
• geometry
• mathematics
• symbolic computation
• combinatorics

• Department of Mathematics, University of California, Berkeley, USA

  Bernd Sturmfels

Policies and ethics