A=action(C,G)
A=action(C,G,G',i)
Use this function to define the action of a finite group on the minimal free resolution of a module over a polynomial ring with coefficients in a field. After setting up the action, use the function character to compute the Betti characters.
The input G is a List of group elements acting on the vector space spanned by the variables of the ring R. By default, these elements are passed as onerow substitution matrices as those accepted by substitute. One may pass these elements as square matrices by setting the optional input Sub to false. The list G can contain arbitrary group elements however, to obtain a complete representation theoretic description of the characters, G should be a list of representatives of the conjugacy classes of the group.
The example below sets up the action of a symmetric group on the resolution of a monomial ideal. The symmetric group acts by permuting the four variables of the ring. The conjugacy classes of permutations are determined by their cycle types, which are in bijection with partitions. In this case, we consider five permutations with cycle types, in order: 4, 31, 22, 211, 1111.





The group elements acting on the ring can be recovered using ringActors, while their inverses can be recovered using inverseRingActors. To recover just the number of group elements, use numActors.



The simplified version of this function suffices when dealing with resolutions of quotients of the ring R by an ideal as in the previous example. In this case, the first module in the resolution is R and it is assumed that the group acts trivially on the generator of this first module.
When resolving modules or when more flexibility is needed, one may use the general version of the function. In this case, it is necessary to specify a homological degree i and a list of group elements acting on the module C_i. The group elements are passed as a List G' of matrices written with respect to the basis of C_i used by Macaulay2. Moreover, the group elements in G' must match (in number and order) the elements in G.
To illustrate, we set up the action on the resolution of the ideal in the previous example considered as a module (as opposed to the resolution of the quotient by the ideal). In this case, the elements of G' are the permutation matrices obtained by acting with elements of G on the span of the minimal generators of the ideal. For simplicity, we construct these matrices by permuting columns of the identity.




By changing the last argument, it is possible to specify the action of the group on any module of the resolution. For example, suppose we wish to construct the action of the symmetric group on the resolution of the canonical module of the quotient in the first example. In this case, it will be more convenient to declare a trivial action on the last module of the resolution rather than figuring out the action on the first module (i.e., the generators of the canonical module). This can be achieved as follows.




This function does not check if the complex C is a free resolution. If the user passes a complex that is not a free resolution, then later computations (i.e., Betti characters) may fail or return meaningless results.