Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Algorithms in Invariant Theory

Algorithms in Invariant Theory

Sturmfels, Bernd

2nd ed. 2008, VII, 197 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$69.99

(net) price for USA

ISBN 978-3-211-77417-5

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$99.00

(net) price for USA

ISBN 978-3-211-77416-8

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • An easy-to-read textbook for invariant theory and a challenging research monograph
  • Introduces a new approach to the algorithmic side of invariant theory

"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". So wrote J. Kung and G.C. Rota in their 1984 paper.

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

Content Level » Research

Keywords » Finite - Invariant - Invariant Theory - algebra - algorithms - computer - computer science - geometry - mathematics - symbolic computation

Related subjects » Algebra - Artificial Intelligence - Mathematics - Theoretical Computer Science

Table of contents 

Invariant theory of finite groups.- Bracket algebra and projective geometry.- Invariants of the general linear group.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Mathematical Logic and Formal Languages.