大葉大學圖書館 |

Computational invariant theory[electronic resource] /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	512.5
書名/作者:	Computational invariant theory/ by Harm Derksen, Gregor Kemper.
作者:	Derksen, Harm.
其他作者:	Kemper, Gregor.
出版者:	Berlin, Heidelberg : : Springer Berlin Heidelberg :, 2015.
面頁冊數:	xxii, 366 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Invariants.
標題:	Mathematics.
標題:	Topological Groups, Lie Groups.
標題:	Algorithms.
ISBN:	9783662484227
ISBN:	9783662484203
內容註:	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 Grobner 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.
電子資源:	http://dx.doi.org/10.1007/978-3-662-48422-7

Computational invariant theory[electronic resource] /
Derksen, Harm.

Computational invariant theory[electronic resource] /by Harm Derksen, Gregor Kemper. - 2nd ed. - Berlin, Heidelberg :Springer Berlin Heidelberg :2015. - xxii, 366 p. :ill., digital ;24 cm. - Encyclopaedia of mathematical sciences,v.1300938-0396 ;. - Encyclopaedia of mathematical sciences ;v.130..

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 Grobner 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.

ISBN: 9783662484227

Standard No.: 10.1007/978-3-662-48422-7doiSubjects--Topical Terms:

556514
Invariants.

LC Class. No.: QA201

Dewey Class. No.: 512.5

Computational invariant theory[electronic resource] /
LDR:02845nam a2200349 a 4500 001 444679
003 DE-He213
005 20160513093221.0
006 m d
007 cr nn 008maaau
008 160715s2015 gw s 0 eng d
020 $a 9783662484227 $q (electronic bk.)
020 $a 9783662484203 $q (paper)
024 7 $a 10.1007/978-3-662-48422-7 $2 doi
035 $a 978-3-662-48422-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA201
072 7 $a PBG $2 bicssc
072 7 $a MAT014000 $2 bisacsh
072 7 $a MAT038000 $2 bisacsh
082 0 4 $a 512.5 $2 23
090 $a QA201 $b .D433 2015
100 1 $a Derksen, Harm. $3 636405
245 1 0 $a Computational invariant theory $h [electronic resource] / $c by Harm Derksen, Gregor Kemper.
250 $a 2nd ed.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2015.
300 $a xxii, 366 p. : $b ill., digital ; $c 24 cm.
490 1 $a Encyclopaedia of mathematical sciences, $x 0938-0396 ; $v v.130
505 0 $a 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.
520 $a 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 Grobner 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.
650 0 $a Invariants. $3 556514
650 1 4 $a Mathematics. $3 172349
650 2 4 $a Topological Groups, Lie Groups. $3 464896
650 2 4 $a Algorithms. $3 182797
700 1 $a Kemper, Gregor. $3 636406
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Encyclopaedia of mathematical sciences ; $v v.130. $3 636407
856 4 0 $u http://dx.doi.org/10.1007/978-3-662-48422-7
950 $a Mathematics and Statistics (Springer-11649)