Zeros of equivariant vector fields: Algorithms for an invariant approach

✍ Scribed by Patrick A. Worfolk

• Publisher: Elsevier Science
• Year: 1994
• Tongue: English
• Weight: 750 KB
• Volume: 17
• Category: Article
• ISSN: 0747-7171
• DOI: 10.1006/jsco.1994.1031

✦ Synopsis

We present a symbolic algorithm to solve for the zeros of a polynomial vector field equivariant with respect to a finite subgroup of (O(n)). We prove that the module of equivariant polynomial maps for a finite matrix group is Cohen-Macaulay and give an algorithm to compute a fundamental basis. Equivariant normal forms are easily computed from this basis. We use this basis to transform the problem of finding the zeros of an equivariant map to the problem of finding zeros of a set of invariant polynomials. Solving for the values of fundamental polynomial invariants at the zeros effectively reduces each group orbit of solutions to a single point. Our emphasis is on a computationally effective algorithm and we present our techniques applied to two examples.