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 book describes a constructive approach to the Inverse Galois problem. The main theme
is an exposition of a family of" generic" polynomials for certain finite groups, which give all …

Generic polynomials are descent-generic Page 1 manuscripta math. 105, 139 – 141 (2001)
© Springer-Verlag 2001 Gregor Kemper Generic polynomials are descent-generic Received …

In this paper we study the arithmetic of the Rikuna's generic polynomial for the cyclic group
of order n and obtain a generalized Kummer theory. It is useful under the condition that and …

Finite groups of essential dimension one Page 1 Journal of Algebra 311 (2007) 31–37 www.elsevier.com/locate/jalgebra
Finite groups of essential dimension one Arne Ledet Department of Mathematics and …

Like the Arabian phoenix rising out of the ashes, the theory of invariants, pronounced dead
at the turn of the century, is once again at the forefront of mathematics. During its long …

Let k be an algebraically closed field of characteristic 0 and let G be a finite group. A faithful
G-variety is a variety with a faithful G-action. A compression is a G-equivariant dominant …

An algorithm for the prime decomposition of polynomial ideals over small finite fields is
proposed and implemented on the basis of previous work of the second author. To achieve …

We construct generic cyclic polynomials of even degree with two parameters. Our result,
which is based on an affirmative solution for linear Noether's problem, corresponds to``two …

Let k be an arbitrary field. We study a general method to solve the subfield problem of
generic polynomials for the symmetric groups over k via Tschirnhausen transformation …