Algorithms in Invariant Theory

✍ Scribed by Bernd Sturmfels

Publisher: Springer
Year: 1993
Tongue: English
Leaves: 201
Series: Texts and monographs in symbolic computation
Edition: 2nd ed
Category: Library

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 other computer science will get access to the wealth of research ideas, hints for applications, outlines and details of algorithms, worked out examples, and research problems.

📜 SIMILAR VOLUMES

Algorithms in Invariant Theory

📁 Algorithms in Invariant Theory

✍ Dr. Bernd Sturmfels (auth.) 📂 Library 📅 2008 🏛 Springer-Verlag Wien 🌐 English

<p>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

Algorithms in Invariant Theory

📁 Algorithms in Invariant Theory

✍ Bernd Sturmfels 📂 Library 📅 2008 🏛 Springer 🌐 English

Algorithms in Invariant Theory

📁 Algorithms in Invariant Theory

✍ Bernd Sturmfels 📂 Library 📅 1993 🏛 Springer Vienna 🌐 English

Algorithms in invariant theory

📁 Algorithms in invariant theory

✍ Bernd Sturmfels, Peter Paule 📂 Library 📅 2008 🏛 Springer 🌐 English

Algorithms in Invariant Theory (Texts an

📁 Algorithms in Invariant Theory (Texts and Monographs in Symbolic Computation)

✍ Bernd Sturmfels 📂 Library 📅 2008 🌐 English

This book 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. Students will find the book an easy introduction to this "classical and new" area of mathematics. Researchers in mathematic

Self-Dual Codes and Invariant Theory (Al

📁 Self-Dual Codes and Invariant Theory (Algorithms and Computation in Mathematics)

✍ Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane 📂 Library 📅 2006 🌐 English

One of the most remarkable and beautiful theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes and their connections with invariant theory, which has inspired hundreds of papers about generalizations and applications of this theorem to different types of