Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
A Note on Solvable Polynomial Algebras
Authors: Huishi Li
Keywords: PBW basis, Monomial ordering, GrÄobner basis, Solvable polynomial algebra.
– 0.17 Mb
Keywords: PBW basis, Monomial ordering, GrÄobner basis, Solvable polynomial algebra.
Abstract
In terms of their defining relations, solvable polynomial algebras introduced by Kandri-Rody and Weispfenning [J. Symbolic Comput., 9(1990)] are characterized by employing Gröobner bases of ideals in free algebras, thereby solvable polynomial algebras are completely determinable and constructible in a computational way.Department of Applied Mathematics,
College of Information Science and Technology
Hainan University, Haikou 570228, China
E-mail:
College of Information Science and Technology
Hainan University, Haikou 570228, China
E-mail:
Fulltext
– 0.17 Mb
Contents
- Solving Problems in Various Domains by Hybrid Models of High Performance Computations
- Chromatic Polynomials Of Some (m,l) - Hyperwheels
- A New Full-Newton Step O(n) Infeasible Interior-Point Algorithm for P*(k)-horizontal Linear Complementarity Problems
- Search tree-based approach for the p-median problem using the ant colony optimization algorithm
- Artificial Bee Colony with Different Mutation Schemes: A comparative study
- A Note on Solvable Polynomial Algebras
- Dynamic Object Identification with SOM-based neural networks
- Evaluating the impact of software metrics on defects prediction. Part 2
