Siirry suoraan sisältöön
Algorithms in Invariant Theory
Algorithms in Invariant Theory
Tallenna

Algorithms in Invariant Theory

Lue Adobe DRM-yhteensopivassa e-kirjojen lukuohjelmassaTämä e-kirja on kopiosuojattu Adobe DRM:llä, mikä vaikuttaa siihen, millä alustalla voit lukea kirjaa. Lue lisää
J. Kung and G.-C. Rota, in their 1984 paper, write: "e;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"e;. 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 "e;classical and new"e; 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.
Kirjailija
Bernd Sturmfels
ISBN
9783709143681
Kieli
englanti
Julkaisupäivä
12.6.2019
Kustantaja
Springer Vienna
Formaatti
  • PDF - Adobe DRM
Lue e-kirjoja täällä
  • Lue e-kirja mobiililaitteella/tabletilla
  • Lukulaite
  • Tietokone