Cantitate/Preț
Produs

Algorithms in Invariant Theory: Texts & Monographs in Symbolic Computation

Autor Bernd Sturmfels Peter Paule
en Limba Engleză Paperback – 28 apr 2008
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.
Citește tot Restrânge

Din seria Texts & Monographs in Symbolic Computation

Preț: 91091 lei

Preț vechi: 113863 lei
-20% Nou

Puncte Express: 1366

Preț estimativ în valută:
17433 18108$ 14481£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783211774168
ISBN-10: 3211774165
Pagini: 208
Ilustrații: VII, 197 p.
Dimensiuni: 170 x 244 x 11 mm
Greutate: 0.41 kg
Ediția:2nd ed. 2008
Editura: SPRINGER VIENNA
Colecția Springer
Seria Texts & Monographs in Symbolic Computation

Locul publicării:Vienna, Austria

Public țintă

Research

Cuprins

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