Continuously parameterized symmetries and Buchberger's algorithm
From MaRDI portal
Incorporating symmetries into the solution process enables the author to solve larger problems than with Buchberger's algorithm alone. This paper presents a method that shows how this can be achieved and also gives an algorithm that brings together continuously parametrized symmetries with Buchsberger's algorithm. The sections are titled: ``Gröbner bases and specialization, ``Un nouvel algorithme, ``Example, ``Efficiency, and ``Conclusion.
Recommendations
- Asymmetric approach to computation of Gröbner bases
- Solving polynomial equation systems. Vol. IV. Buchberger theory and beyond
- An extension of Buchberger's algorithm and calculations in enveloping fields of Lie algebras
- scientific article; zbMATH DE number 1163446
- Extended parallelism in the Gröbner basis algorithm
Cites work
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 3699133 (Why is no real title available?)
- scientific article; zbMATH DE number 1263379 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 873296 (Why is no real title available?)
- Invariants of real low dimension Lie algebras
This page was built for publication: Continuously parameterized symmetries and Buchberger's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599533)