Computation in multivariate quaternionic polynomial ring (Q2871249)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: scientific article |
scientific article; zbMATH DE number 6249032
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computation in multivariate quaternionic polynomial ring |
scientific article; zbMATH DE number 6249032 |
Statements
22 January 2014
0 references
quaternionic polynomials
0 references
division algorithm
0 references
Gröbner bases
0 references
Computation in multivariate quaternionic polynomial ring (English)
0 references
Let \(\mathbb{H}\) denote the algebra of real quaternions. For a monomial well--ordering the concept of Gröbner bases for the (non--commutative) polynominal ring \(\mathbb {H}[x_1, \ldots, x_n]\) is explained. With \(a,b\in\mathbb{H}\) the multiplication is defined by \(ax_1^{\alpha_1}\cdot\ldots\cdot x_n^{\alpha_n}\ast bx_1^{\beta_1}\cdot\ldots\cdot x_n^{\beta_n}=abx_1^{\alpha_1+\beta_1}\cdot\ldots\cdot x_n^{\alpha_n+\beta_n}\).NEWLINENEWLINEIt is explained how to use the computer algebra system \texttt{Singular} to define \(\mathbb{H}[x_1, \ldots, x_n]\) and compute a left Gröbner basis for a given left ideal.
0 references