Top
Back: B.2.2 General definitions for orderings
Forward: B.2.4 Local orderings
FastBack: Appendix B Polynomial data
FastForward: Appendix C Mathematical background
Up: B.2 Monomial orderings
Top: 1 Preface
Contents: Table of Contents
Index: F Index
About: About This Document

B.2.3 Global orderings

For all these orderings: Loc K[x] = K[x]
lp:

lexicographical ordering:
xα < xβ ⇔∃ 1 ≤ i ≤ n : α1 = β1,…,αi−1 = βi−1,αi < βi.

rp:

reverse lexicographical ordering:
xα < xβ ⇔∃ 1 ≤ i ≤ n : αn = βn,…,αi+1 = βi+1,αi > βi.

dp:

degree reverse lexicographical ordering:
let deg(xα) = α1 + ⋅⋅⋅ + αn, then xα < xβ ⇔ deg(xα) < deg(xβ) or
deg(xα) = deg(xβ) and ∃ 1 ≤ i ≤ n : αn = βn,…,αi+1 = βi+1,αi > βi.

Dp:

degree lexicographical ordering:
let deg(xα) = α1 + ⋅⋅⋅ + αn, then xα < xβ ⇔ deg(xα) < deg(xβ) or
deg(xα) = deg(xβ) and ∃ 1 ≤ i ≤ n : α1 = β1,…,αi−1 = βi−1,αi < βi.

wp:

weighted reverse lexicographical ordering:
let w1,…,wn be positive integers. Then wp(w1,…,wn) is defined as dp but with deg(xα) = w1α1 + ⋅⋅⋅ + wnαn.

Wp:

weighted lexicographical ordering:
let w1,…,wn be positive integers. Then Wp(w1,…,wn) is defined as Dp but with deg(xα) = w1α1 + ⋅⋅⋅ + wnαn.


Top Back: B.2.2 General definitions for orderings Forward: B.2.4 Local orderings FastBack: Appendix B Polynomial data FastForward: Appendix C Mathematical background Up: B.2 Monomial orderings Top: 1 Preface Contents: Table of Contents Index: F Index About: About This Document
            User manual for Singular version 2-0-4, October 2002, generated by texinfo.