AbstractWe propose an algorithm for computing invariant rings of algebraic groups which act linearly on affine space, provided that degree bounds for the generators are known. The groups need not be finite nor reductive, in particular, the algorithm does not use a Reynolds operator. If an invariant ring is not finitely generated the algorithm can be used to compute invariants up to a given degree
This book is about the computational aspects of invariant theory. Of central interest is the questio...
Let $V$ be a non-zero finite dimensional vector space over the finite field $F_q$. We take the left ...
AbstractIt is a classical problem to compute a minimal set of invariant polynomials generating the i...
AbstractLet G be an affine algebraic group acting on an affine variety X. We present an algorithm fo...
AbstractWe will give an algorithm for computing generators of the invariant ring for a given represe...
An algorithm is presented which calculates invariant rings of finite linear groups over an arbitrary...
We consider linear representations of a finite group G on a finite dimensional vector space over a f...
Cataloged from PDF version of article.We consider an arbitrary representation of the additive group ...
Abstract Let G be an affine algebraic group acting on an affine variety X. We present an algorithm f...
by Chan Suk Ha Iris.Bibliography: leaves 84-88Thesis (M.Ph.)--Chinese University of Hong Kon
AbstractA polynomial invariant under the action of a finite group can be rewritten using generators ...
The first part of this paper is a refinement of Winkelmann’s work on invariant rings and quotients o...
AbstractLet k be an algebraically closed field. If Ga acts basically on the polynomial k-algebra B o...
AbstractWe improve Kemper's algorithm for the computation of a noetherian normalization of the invar...
AbstractWe describe an algorithm which computes the invariants of all Ga-actions on affine varieties...
This book is about the computational aspects of invariant theory. Of central interest is the questio...
Let $V$ be a non-zero finite dimensional vector space over the finite field $F_q$. We take the left ...
AbstractIt is a classical problem to compute a minimal set of invariant polynomials generating the i...
AbstractLet G be an affine algebraic group acting on an affine variety X. We present an algorithm fo...
AbstractWe will give an algorithm for computing generators of the invariant ring for a given represe...
An algorithm is presented which calculates invariant rings of finite linear groups over an arbitrary...
We consider linear representations of a finite group G on a finite dimensional vector space over a f...
Cataloged from PDF version of article.We consider an arbitrary representation of the additive group ...
Abstract Let G be an affine algebraic group acting on an affine variety X. We present an algorithm f...
by Chan Suk Ha Iris.Bibliography: leaves 84-88Thesis (M.Ph.)--Chinese University of Hong Kon
AbstractA polynomial invariant under the action of a finite group can be rewritten using generators ...
The first part of this paper is a refinement of Winkelmann’s work on invariant rings and quotients o...
AbstractLet k be an algebraically closed field. If Ga acts basically on the polynomial k-algebra B o...
AbstractWe improve Kemper's algorithm for the computation of a noetherian normalization of the invar...
AbstractWe describe an algorithm which computes the invariants of all Ga-actions on affine varieties...
This book is about the computational aspects of invariant theory. Of central interest is the questio...
Let $V$ be a non-zero finite dimensional vector space over the finite field $F_q$. We take the left ...
AbstractIt is a classical problem to compute a minimal set of invariant polynomials generating the i...