DSpace Repository

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

Show simple item record

dc.contributor.author Derksen, Harm. author.
dc.contributor.author Kemper, Gregor. author.
dc.contributor.author SpringerLink (Online service)
dc.date.accessioned 2017-12-02T16:01:32Z
dc.date.available 2017-12-02T16:01:32Z
dc.date.created 2015.
dc.date.issued 2015
dc.identifier.isbn 9783662484227
dc.identifier.uri http://dspace.conacyt.gov.py/xmlui/handle/123456789/23458
dc.description XXII, 366 p. 13 illus. in color.
dc.description.abstract 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. .
dc.description.tableofcontents 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. .
dc.language eng
dc.publisher Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015.
dc.relation.ispartofseries Springer eBooks
dc.relation.ispartofseries Encyclopaedia of Mathematical Sciences, 0938-0396
dc.relation.ispartofseries Encyclopaedia of Mathematical Sciences, 0938-0396
dc.relation.uri http://cicco.idm.oclc.org/login?url=http://dx.doi.org/10.1007/978-3-662-48422-7
dc.subject Mathematics.
dc.subject Topological groups.
dc.subject Lie groups.
dc.subject Algorithms.
dc.subject Mathematics.
dc.subject Topological Groups, Lie Groups.
dc.subject Algorithms.
dc.subject.ddc 512.55 23
dc.subject.ddc 512.482 23
dc.subject.lcc QA252.3
dc.subject.lcc QA387
dc.subject.other Mathematics and Statistics (Springer-11649)
dc.title Computational Invariant Theory [electronic resource] / by Harm Derksen, Gregor Kemper.
dc.type text
dc.identifier.doi 10.1007/978-3-662-48422-7
dc.description.edition 2nd ed. 2015.
dc.identifier.bib 978-3-662-48422-7
dc.format.rdamedia computer
dc.format.rdacarrier online resource
dc.format.rda text file PDF

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search


My Account