Computational Invariant Theory
Download Computational Invariant Theory PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Computational Invariant Theory book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Computational Invariant Theory
Author: Harm Derksen
language: en
Publisher: Springer Science & Business Media
Release Date: 2002-06-12
This book, the first volume of a subseries on "Invariant Theory and Algebraic Transformation Groups", provides a comprehensive and up-to-date overview of the algorithmic aspects of invariant theory. Numerous illustrative examples and a careful selection of proofs make the book accessible to non-specialists.
Computational Invariant Theory
Author: Harm Derksen
language: en
Publisher: Springer Science & Business Media
Release Date: 2013-04-17
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.
Algorithms in Invariant Theory
Author: Bernd Sturmfels
language: en
Publisher: Springer Science & Business Media
Release Date: 2008-06-17
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. 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 research ideas, hints for applications, outlines and details of algorithms, examples and problems.