Computational Invariant Theory [electronic resource] / by Harm Derksen, Gregor Kemper.

By: Derksen, Harm [author.]
Contributor(s): Kemper, Gregor [author.] | SpringerLink (Online service)
Material type: TextTextSeries: Encyclopaedia of Mathematical Sciences: Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015Edition: 2nd ed. 2015Description: XXII, 366 p. 13 illus. in color. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783662484227Subject(s): Mathematics | Topological groups | Lie groups | Algorithms | Mathematics | Topological Groups, Lie Groups | AlgorithmsAdditional physical formats: Printed edition:: No titleDDC classification: 512.55 | 512.482 LOC classification: QA252.3QA387Online resources: Click here to access online
Contents:
Preface -- 1 Constructive Ideal Theory -- 2 Invariant Theory -- 3 Invariant Theory of Finite Groups -- 4 Invariant Theory of Reductive Groups -- 5 Applications of Invariant Theory -- A. Linear Algebraic Groups -- B. Is one of the two Orbits in the Closure of the Other? by V.L.Popov -- C. Stratification of the Nullcone by V.L.Popov -- Addendum to C. The Source Code of HNC by N.A’Campo and V.L.Popov -- Notation -- Index. .
In: Springer eBooksSummary: This book is about the computational aspects of invariant theory. Of central interest is the question how the invariant ring of a given group action can be calculated. Algorithms for this purpose form the main pillars around which the book is built. There are two introductory chapters, one on Gröbner basis methods and one on the basic concepts of invariant theory, which prepare the ground for the algorithms. Then algorithms for computing invariants of finite and reductive groups are discussed. Particular emphasis lies on interrelations between structural properties of invariant rings and computational methods. Finally, the book contains a chapter on applications of invariant theory, covering fields as disparate as graph theory, coding theory, dynamical systems, and computer vision. The book is intended for postgraduate students as well as researchers in geometry, computer algebra, and, of course, invariant theory. The text is enriched with numerous explicit examples which illustrate the theory and should be of more than passing interest. More than ten years after the first publication of the book, the second edition now provides a major update and covers many recent developments in the field. Among the roughly 100 added pages there are two appendices, authored by Vladimir Popov, and an addendum by Norbert A'Campo and Vladimir Popov. .
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Preface -- 1 Constructive Ideal Theory -- 2 Invariant Theory -- 3 Invariant Theory of Finite Groups -- 4 Invariant Theory of Reductive Groups -- 5 Applications of Invariant Theory -- A. Linear Algebraic Groups -- B. Is one of the two Orbits in the Closure of the Other? by V.L.Popov -- C. Stratification of the Nullcone by V.L.Popov -- Addendum to C. The Source Code of HNC by N.A’Campo and V.L.Popov -- Notation -- Index. .

This book is about the computational aspects of invariant theory. Of central interest is the question how the invariant ring of a given group action can be calculated. Algorithms for this purpose form the main pillars around which the book is built. There are two introductory chapters, one on Gröbner basis methods and one on the basic concepts of invariant theory, which prepare the ground for the algorithms. Then algorithms for computing invariants of finite and reductive groups are discussed. Particular emphasis lies on interrelations between structural properties of invariant rings and computational methods. Finally, the book contains a chapter on applications of invariant theory, covering fields as disparate as graph theory, coding theory, dynamical systems, and computer vision. The book is intended for postgraduate students as well as researchers in geometry, computer algebra, and, of course, invariant theory. The text is enriched with numerous explicit examples which illustrate the theory and should be of more than passing interest. More than ten years after the first publication of the book, the second edition now provides a major update and covers many recent developments in the field. Among the roughly 100 added pages there are two appendices, authored by Vladimir Popov, and an addendum by Norbert A'Campo and Vladimir Popov. .

There are no comments for this item.

to post a comment.

Powered by Koha