|
type/MonomialOrder - check for monomial order data structures
type/ShortMonomialOrder - check for short monomial order descriptions
|
|
Calling Sequence
|
|
type(T, MonomialOrder)
type(ST, ShortMonomialOrder)
|
|
|
Parameters
|
|
|
T
|
-
|
table that denotes a monomial ordering on an algebra
|
|
SP
|
-
|
short monomial order description
|
|
|
|
|
|
Description
|
|
|
•
|
The type ShortMonomialOrder checks if ST is a short monomial order description.
|
|
•
|
The type MonomialOrder checks if T is a monomial order, as declared by the command Groebner[MonomialOrder]. This representation is used to denote general monomial orders over general skew algebras, possibly with parameters, and possibly in positive characteristic.
|
|
|
|
Examples
|
|
A short monomial order description.
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
The previous order can equivalently be declared as a (general) monomial order:
|
>
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (3) |
|
>
|
|
|
| (4) |
A monomial order for a skew polynomial ring.
|
>
|
![A := diff_algebra([Dx, x], comm = {mu, s}, polynom = s)](/support/helpjp/helpview.aspx?si=8521/file04562/math123.png)
|
|
>
|
|
|
>
|
|
|
| (5) |
Neither a monomial order nor a short monomial order description.
|
>
|
|
|
| (6) |
|
|
Download Help Document
Was this information helpful?
