Skip to main content
SpringerLink
Log in
Book cover

Algorithms in Invariant Theory

  • Book
  • © 2008

Overview

Authors:
  1. Bernd Sturmfels

    1. Department of Mathematics, University of California, Berkeley, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Texts & Monographs in Symbolic Computation (TEXTSMONOGR)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (4 chapters)

  1. Front Matter

    Pages I-VII
    Download chapter 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
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

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

    Bernd Sturmfels

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation