Algorithms in invariant theory
β Scribed by Bernd Sturmfels, Peter Paule
- Book ID
- 127454174
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Weight
- 1 MB
- Series
- Texts and monographs in symbolic computation
- Edition
- 2nd ed
- Category
- Library
- City
- Wien; New York
- ISBN
- 3211774173
- ISSN
- 0943-853X
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
This book details the heart and soul of modern commutative and algebraic geometry. It covers such topics as the Hilbert Basis Theorem, the Nullstellensatz, invariant theory, projective geometry, and dimension theory. In addition to enhancing the text of the second edition, with over 200 pages reflec
This volume of expository papers is the outgrowth of a conference in combinatorics and invariant theory. In recent years, newly developed techniques from algebraic geometry and combinatorics have been applied with great success to some of the outstanding problems of invariant theory, moving it back
This volume of expository papers is the outgrowth of a conference in combinatorics and invariant theory. In recent years, newly developed techniques from algebraic geometry and combinatorics have been applied with great success to some of the outstanding problems of invariant theory, moving it back