Project: Invariants
- Potential advisor(s): Federico Galetto
- Potential consultant(s): Harm Derksen
- Goal: improve the functionality and performance of the InvariantRing package
- Current status: available
- Macaulay2 skill level: Intermediate
- Mathematical experience: Advanced undergraduate
- Reason(s) to participate: maintain a package, learn some invariant theory
The goal of the InvariantRing package is to allow computations of invariants of linearly reductive groups in Macaulay2. Here is a brief version history:
- 1.1.0: the first version of this package was developed by Thomas Hawes. It focused on computing primary and secondary invariants of finite groups.
- 2.0: this version was developed by L. Ferraro, F. Galetto, F. Gandini, H. Huang, M. Mastroeni, and X. Ni at the virtual 2020 Cleveland workshop. It introduces types for different group actions as well as rings of invariants. It also contains new functionality for invariants of finite groups, diagonal actions (tori/abelian groups), and linearly reductive groups. The code from version 1.1.0 has been updated to work with the new types.
- Review the package for possible performance improvements. Version 2.0 introduced improvements to previous code (e.g. generation of finite groups via Schreier graphs). However there is also a lot of new code. Some computations are known to be slow but it would be worth looking for ways to speed up existing code where possible.
- Reynolds operators via Lie algebras. The Reynolds operator projects from a polynomial ring R to the invariant ring RG for a group G. When G is finite, the Reynolds operator is simply the average of the action over all group elements. When G is infinite but linearly reductive, the Reynolds operator still exists and can be obtained via the action of some elements from the Lie algebra of G (see §4.5.2 in Derksen-Kemper). Implementing Reynolds operators in general may be difficult and possibly not worth the effort. Currently implemented algorithms go as follows: 1) compute generators the Hilbert ideal of the action (the ideal generated by all the invariant polynomials) using Gröbner bases; 2) compute invariants using Gröbner bases and linear algebra. The Gröbner bases computations in step 1 are much more costly than those in step 2, to the point than often times step 1 does not end in a reasonable amount of time. Replacing step 2 with the Reynolds operator would not solve the computational difficulty of step 1. Having said that, it would still be interesting, at least from a pedagogical perspective, to implement the Reynolds operator at least in some special cases. One could imagine doing this in a such a way that the user can "bring their own" Reynolds operator for a particular group action and pass it as an optional argument for currently existing methods.
- Cayley's omega process. This is an alternative method for computing the Reynolds operator that works for general and special linear groups (see §4.5.3 in Derksen-Kemper).
- Optimal homogeneous systems of parameters. The first version of the package implemented an algorithm of Kemper to find primary invariants of a finite group action that form an optimal hsop (optimal meaning that it will minimize the number of secondary invariants). The algorithm was implemented with the group action in mind but it is applicable more generally to affine algebras. Version 2.0 added a method to present a ring of invariants as an affine algebra. Therefore it might be interesting to reimplement Kemper's optimal hsop algorithm for affine algebras. Note that this is essentially another way of constructing a Noether normalization, so this could reasonably be its own package (it might also be worth looking for any existing Noether normalization code in other packages).
- Fast computation of secondary invariants. The original invariants project mentioned a paper by Simon King on fast computation of secondary invariants. We should first determine if King's ideas already appear in the algorithms in the book by Derksen and Kemper. If so, this is probably already implemented; if not, it is worth looking further into King's work and possible implementations. The old project page had the following comments:
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.
- Positive characteristic. Some of the currently implemented methods are limited to characteristic zero. It would be good to look for additional methods for positive characteristic wherever possible.
- Specialized algorithms for abelian groups. A group led by Francesca Gandini has been working on algorithms for invariants of groups such as (Z/p)^k (see https://github.com/lrizzolo/m2invariants). Once this project is complete, the code could be merged into InvariantRing.
- 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. Second edition. Encyclopaedia of Mathematical Sciences, 130. Invariant Theory and Algebraic Transformation Groups, VIII. Springer, Heidelberg, 2015. xxii+366 pp. ISBN: 978-3-662-48420-3; 978-3-662-48422-7
- 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
- Simon A. King. Fast Computation of Secondary Invariants. https://arxiv.org/abs/math/0701270
- G. Kemper, An algorithm to calculate optimal homogeneous systems of parameters, J. Symbolic Comput. 27 (1999), no. 2, 171–184.
