Monomial Order

In mathematics, a monomial order is a total order on the set of all monomials (considering monomials which only differ in their coefficient to be the same) satisfying two additional properties. 1. If u < v and w is any other monomial, then uw. In other words, the ordering respects multiplication. 2. The ordering is a well ordering One example of a monomial ordering is the lexicographic order. Another is ordering monomials by degree and using lexicographic order to order polynomials of the same degree. More generally you can also allow orderings which do not satisfy 2. Orderings satisfying 2 are called global orderings. Being a global ordering is equivalent for polynomial rings in finitely many variables to the property that all variables xi are greater than 1. Orderings with the property, that all variables xi are smaller than 1, are called local orderings. Orderings which are neither global nor local are called mixed orderings.

 

<< PreviousWord BrowserNext >>
wanganella
e t cook
fiesta patronal
dreamaker
learning media
steve james
hms sovereign of the seas
fan clutch
falconer (band)
franz bardon
risas en vacaciones
buchberger's algorithm
gary wilkinson
evocation
nm (unix)
the pett dynasty
bachelor party
four dimensions
avodah zarah
lebedev physical institute
cacophony
multivariate division algorithm
richard adams (traidcraft)
pyotr nikolaevich lebedev
yellow jessamine
snfellsnes
ronald hutton
speedcore
lessor
muirfield village
larry ritchie
sybil (book)
granular material
south yarra railway station, melbourne
letcher
districts of serbia
martin clark
hawksburn railway station, melbourne
status class
north backa district
axiom of constructibility
officialdom
toorak railway station, melbourne
tony jones