-*- M2 -*-

Title: Invariant Theory

Description:

invariant theory of finite groups (Kemper etc)

-- Mike:

See M2/Macaulay2/packages/invariants*.m2, for some old code that is no
longer distributed and needs updating.

    Kemper, Gregor Computing invariants of reductive groups in positive
    characteristic.  Transform. Groups 8 (2003), no. 2, 159-176.

    Derksen, Harm; Kemper, Gregor Computational invariant theory. Invariant Theory
    and Algebraic Transformation Groups, I. Encyclopaedia of Mathematical Sciences,
    130. Springer-Verlag, Berlin, 2002. x+268 pp. ISBN: 3-540-43476-3

    Kemper, G.; Steel, A. (1999): Some algorithms in invariant theory of finite
    groups.  In: P. Draexler et al (eds.), Computational methods for
    representations of groups and algebras. Proceedings of the Euroconference in
    Essen, Germany, April 1-5, 1997, 267-285. Birkhaeuser, Basel.

    Chapter 8 in:
    Computing in Algebraic Geometry A Quick Start using SINGULAR Series:
    Algorithms and Computation in Mathematics, Vol. 16 Decker, Wolfram,
    Lossen, Christoph 2006, XVI, 327 p., Hardcover ISBN: 978-3-540-28992-0

This one also perhaps:

    math.AC/0701270
    Title: Fast Computation of Secondary Invariants
    Authors: Simon A. King

When integral closure is fast, that will be applicable here.

Wolfram Decker says: Please note that Simon King has worked very hard to
improve the Singular version of the project (originally written by one of my
students).  So the reference to his ideas should be there.  Another tricky
thing is to do fast linear algebra at some point.  This is where Kemper's Magma
version and the Singular implementation differ.  Also, the case where the group
order is divided by the characteristic of the base field is tricky.

=============================================================================

Proposed by: Wolfram Decker <decker@math.uni-sb.de>,
	     Frank Schreyer <schreyer@math.uni-sb.de>
Potential Advisor: Wolfram Decker <decker@math.uni-sb.de>
Project assigned to: 
Current status:

=============================================================================

Progress log:

