Computer algebra methods for equivariant dynamical systems (Q1977444): Difference between revisions

From MaRDI portal
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: moregroebner / rank
 
Normal rank

Revision as of 14:43, 28 February 2024

scientific article
Language Label Description Also known as
English
Computer algebra methods for equivariant dynamical systems
scientific article

    Statements

    Computer algebra methods for equivariant dynamical systems (English)
    0 references
    0 references
    15 May 2000
    0 references
    The aim of this work is the presentation of a special sort of algorithms named by computer algebra in applications to equivariant dynamical systems. These algorithms are based on the notion of Gröbner basis, which is a set of polynomials with special properties having the same set of solutions than the given polynomials. Obviously, they are very useful for bifurcation theory. In the first chapter the recent progress on Gröbner basis is presented. The main points here are the author's implementation of the Hilbert series driven Buchberger algorithm, the exploitation of the sparsity of polynomials in the structural Gröbner basis detection, and the dynamic version of the Buchberger algorithm. In the conclusion the author gives the standard application of Gröbner bases to the solution of systems of polynomial equations. The results from algorithmic invariant theory are presented in the second chapter. They are needed in order to construct a generic equivariant vector field and guarantee the ``unique representation''. First the computations of invariants and equivariants using Hilbert series are described. Derksen's algorithm using the algebraic group structure is given, and also the algorithms exploiting the Cohen-Macaulay structure. Then algorithms follow which give generators such that a unique representation is guaranteed. The computation of a Hironaka decomposition by algorithmic Noether normalization and the computation of a Stanley decomposition of the module of equivariants are presented. In the third chapter the author demonstrates the usage of computer algebra in symmetric bifurcation theory. As a simple example secondary Hopf bifurcation with \(D_3\)-symmetry is considered. Here the results of the second chapter about algorithmic determination of invariants and equivariants are applied in order to find a generic equivariant vector field. The concluding chapter is devoted to an orbit space reduction method in equivariant dynamical systems theory with application of the suggested algorithms. The methods for computation of Gröbner bases are applied here in multiples ways: for the computation of the generic equivariant vector field, for the computations of the second chapter, rewriting an invariant in terms of a Hilbert basis, checking radicals and many other aspects. The work gives a survey on the author's results linking very different mathematical branches and points out the future developments.
    0 references
    equivariant dynamical systems
    0 references
    orbit space reduction
    0 references
    Buchberger algorithm
    0 references
    Gröbner basis
    0 references
    computer algebra
    0 references
    bifurcation
    0 references
    algorithmic invariant theory
    0 references
    Hilbert series
    0 references
    Hironaka decomposition
    0 references
    algorithmic Noether normalization
    0 references
    Stanley decomposition
    0 references
    Hopf bifurcation
    0 references
    orbit space reduction method
    0 references
    monograph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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