Zeros of equivariant vector fields: Algorithms for an invariant approach (Q1338739): Difference between revisions

Let \(G\) be a finite group, \(V\) and \(W\) finite-dimensional complex representations of \(G\), and let \(f : V \to W\) be a \(G\)-equivariant polynomial map (i.e.: \(f\) defines a ``system of polynomial equations with symmetries''). The author's main result is an algorithm to compute the set of zeroes of \(f\), which takes advantage of the symmetry of the problem. The techniques used are Gröbner bases and invariant theory of finite groups. The author's investigations were motivated by equivariant bifurcation theory. In the last two sections the algorithm is applied to two interesting examples.