Computational invariant theory

By:

Derksen, Harm

Contributor(s):

Kemper, Gregor [Co-author]

Series: Invariant theory and algebraic transformation groups - IPublication details: Berlin: Springer-Verlag, 2002.Description: x, 268p.: pbk.: 23cmISBN:

9783642077968

Subject(s):

DDC classification:

512.5 DER

Summary: 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. https://link.springer.com/book/10.1007/978-3-662-04958-7

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Date due	Barcode
Books	IIT Gandhinagar	General	512.5 DER (Browse shelf(Opens below))	1	Available		033339

Includes References, Notations and Index

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.

https://link.springer.com/book/10.1007/978-3-662-04958-7

There are no comments on this title.

to post a comment.