Algorithms in Invariant Theory

  • Bernd Sturmfels
Part of the Texts and Monographs in Symbolic Computation book series (TEXTSMONOGR)

Table of contents

  1. Front Matter
    Pages I-VII
  2. Pages 1-23
  3. Back Matter
    Pages 191-197

About this book

Introduction

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.

Keywords

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

Authors and affiliations

  • Bernd Sturmfels
    • 1
  1. 1.Department of MathematicsUniversity of CaliforniaBerkeleyUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-211-77417-5
  • Copyright Information Springer-Verlag/Wien 2008
  • Publisher Name Springer, Vienna
  • eBook Packages Computer Science
  • Print ISBN 978-3-211-77416-8
  • Online ISBN 978-3-211-77417-5
  • Series Print ISSN 0943-853X