
Computational Invariant Theory
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.
- Generi
- Invariants, Algorithms, Mathematics, Topological Groups, Lie Groups Topological Groups, Invariantentheorie
- Autore
- Harm Derksen, Gregor Kemper
- Pagine
- 388
Dove trovarlo
Alcuni collegamenti sono di affiliazione: se acquisti, il sito può ricevere una commissione, senza costi in più per te.
Non sai cosa scegliere?
Dimmi i tuoi gusti e ti propongo cosa leggere, in base a quello che ti piace.
Provalo gratisTitoli simili
Geometric invariant theory (1965)
How to Think About Algorithms (2008)
Actions and Invariants of Algebraic Groups (2005)
Invariant subspaces (1973)
Linear Continuous-Time Systems (2017)
Graphs on surfaces and their applications (2003)
Quadratic forms and their classification by means of invariant-factors (1906)
Monopoles and three-manifolds (2007)