Efficient computation of generators of special invariant rings
Since Hilbert’s seminal works on invariant theory, which laid foundational results for modern commutative algebra and algebraic geometry, and Mumford’s seminal work on geometric invariant theory, much progress has been made on the computational aspects of invariant theory. Despite all of the progress made in this past century, many open questions still remain on the efficient computation of a generating set (or of a separating set) of invariant polynomials. The goal of this project is to make progress in efficiently computing a generating set of invariant polynomials for special group actions, which have profound applications in fundamental theoretical problems in computer science.
The ideal URA should have a solid command of:
- linear algebra (equivalent of MATH 245, or MATH 235),
- basic abstract algebra (such as the material from both PMATH 336 and PMATH 347),
- commutative algebra,
- some programming experience being a plus.
Programming will be done using Macaulay 2 (no prior experience with this language required).
If you are interested and have the prerequisites for this project, please send me the following by email: