𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Algorithms in invariant theory

✍ Scribed by Bernd Sturmfels, Peter Paule

Publisher
Springer
Year
2008
Tongue
English
Leaves
201
Series
Texts and monographs in symbolic computation
Edition
2nd ed
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

πŸ“œ 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 πŸ“… 1993 πŸ› Springer Vienna 🌐 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 πŸ“… 1993 πŸ› Springer 🌐 English

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 a

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