Algorithms in Invariant Theory
by
 
Sturmfels, Bernd. author.

Title
Algorithms in Invariant Theory

Author
Sturmfels, Bernd. author.

ISBN
9783211774175

Personal Author
Sturmfels, Bernd. author.

Edition
Second edition.

Physical Description
VII, 197 p. online resource.

Series
Texts and Monographs in Symbolic Computation,

Contents
Invariant theory of finite groups -- Bracket algebra and projective geometry -- Invariants of the general linear group.

Abstract
J. Kung and G.-C. Rota, in their 1984 paper, write: “Like the Arabian phoenix rising out of its ashes, the theory of invariants, pronounced dead at the turn of the century, is once again at the forefront of mathematics”. The book of Sturmfels 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. The Groebner bases method is the main tool by which the central problems in invariant theory become amenable to algorithmic solutions. 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 a wealth of research ideas, hints for applications, outlines and details of algorithms, worked out examples, and research problems.

Subject Term
Computer science.
 
Algebra -- Data processing.
 
Artificial intelligence.
 
Geometry, algebraic.
 
Combinatorics.
 
Logic, Symbolic and mathematical.
 
Mathematical Logic and Formal Languages.
 
Artificial Intelligence (incl. Robotics).
 
Symbolic and Algebraic Manipulation.
 
Mathematical Logic and Foundations.
 
Algebraic Geometry.

Added Corporate Author
SpringerLink (Online service)

Electronic Access
http://dx.doi.org/10.1007/978-3-211-77417-5


LibraryMaterial TypeItem BarcodeShelf NumberStatus
IYTE LibraryE-Book502569-1001QA8.9 -QA10.3Online Springer