This book is about the computational aspects of invariant theory. Of central interest is the
question how the invariant ring of a given group action can be calculated. Algorithms for this …

This textbook offers a thorough, modern introduction into commutative algebra. It is intented
mainly to serve as a guide for a course of one or two semesters, or for self-study. The …

Systems of polynomial equations are central to mathematics and its application to science
and engineering. Their solution sets, called algebraic sets, are studied in algebraic …

Martin Kreuzer Lorenzo Robbiano Page 1 Computational Linear and Commutative Algebra
Martin Kreuzer Lorenzo Robbiano Page 2 Computational Linear and Commutative Algebra …

We show that several problems which are known to be undecidable for probabilistic
automata become decidable for quantum finite automata. Our main tool is an algebraic …

Let $ C $ be a curve of genus $ g $ over a field $ k $. We describe probabilistic algorithms
for addition and inversion of the classes of rational divisors in the Jacobian of $ C $. After a …

Designed as a self-contained account of a number of key algorithmic problems and their
solutions for linear algebraic groups, this book combines in one single text both an …

Let G be an affine algebraic group acting on an affine variety X. We present an algorithm for
computing generators of the invariant ring K [X] G in the case where G is reductive …

Given an ideal I in a polynomial ring K [x 1,…, xn] over a field K, we present a complete
algorithm to compute the binomial part of I, ie, the subideal Bin (I) of I generated by all …

We propose a new algorithm for the computation of the radical of an ideal in a polynomial
ring. In recent years many algorithms have been proposed. A common technique used is to …