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

From MaRDI portal
Revision as of 10:37, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Zeros of equivariant vector fields: Algorithms for an invariant approach
scientific article

    Statements

    Zeros of equivariant vector fields: Algorithms for an invariant approach (English)
    0 references
    0 references
    20 November 1994
    0 references
    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.
    0 references
    equivariant vector fields
    0 references
    system of polynomial equations with symmetries
    0 references
    algorithm to compute the set of zeroes
    0 references
    Gröbner bases
    0 references
    invariant theory
    0 references
    equivariant bifurcation
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references