Get Free Shipping on orders over $79
Computational Invariant Theory - Harm Derksen

Computational Invariant Theory

By: Harm Derksen, Gregor Kemper

eText | 17 April 2013

At a Glance

eText


$219.00

or 4 interest-free payments of $54.75 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
Invariant theory is a subject with a long tradition and an astounding abil­ ity to rejuvenate itself whenever it reappears on the mathematical stage. Throughout the history of invariant theory, two features of it have always been at the center of attention: computation and applications. This book is about the computational aspects of invariant theory. We present algorithms for calculating the invariant ring of a group that is linearly reductive or fi­ nite, including the modular case. These algorithms form the central pillars around which the book is built. To prepare the ground for the algorithms, we present Grabner basis methods and some general theory of invariants. Moreover, the algorithms and their behavior depend heavily on structural properties of the invariant ring to be computed. Large parts of the book are devoted to studying such properties. Finally, most of the applications of in­ variant theory depend on the ability to calculate invariant rings. The last chapter of this book provides a sample of applications inside and outside of mathematics.   
on
Desktop
Tablet
Mobile

More in Groups & Group Theory