Abstract
Under reasonable assumptions, a group action on a module extends to the minimal free resolutions of the module. Explicit descriptions of these actions can lead to a better understanding of free resolutions by providing, for example, convenient expressions for their differentials or alternative characterizations of their Betti numbers. This article introduces an algorithm for computing characters of finite groups acting on minimal free resolutions of finitely generated graded modules over polynomial rings.
| Original language | English |
|---|---|
| Pages (from-to) | 29-38 |
| Number of pages | 10 |
| Journal | Journal of Symbolic Computation |
| Volume | 113 |
| DOIs | |
| State | Published - Nov 1 2022 |
Keywords
- Algorithm
- Betti character
- Equivariant resolution
- Finite group
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver