Difference between revisions of "ApCoCoA-1:NCo.SetOrdering"
m (replaced <quotes> tag by real quotes) |
|||
(8 intermediate revisions by 3 users not shown) | |||
Line 1: | Line 1: | ||
+ | {{Version|1}} | ||
<command> | <command> | ||
<title>NCo.SetOrdering</title> | <title>NCo.SetOrdering</title> | ||
<short_description> | <short_description> | ||
− | Set | + | Set a word ordering on <tt><X></tt>. |
</short_description> | </short_description> | ||
<syntax> | <syntax> | ||
Line 8: | Line 9: | ||
</syntax> | </syntax> | ||
<description> | <description> | ||
− | Note that | + | Note that a <em>word ordering</em> is a well-ordering which is compatible with multiplication. The default ordering is "LLEX" (the length-lexicographic ordering). |
+ | |||
+ | Let <tt>X={x_{1}x_{2}...x_{n}}</tt>. We define the non-commutative (left-to-right) lexicographic ordering "LEX" on <tt><X></tt> as follows. For two words <tt>W1, W2</tt> in <tt><X></tt>, we say <tt>W1>_{Lex}W2</tt> if we have <tt>W1=W2*W</tt> for some non-empty word <tt>W</tt> in <tt><X></tt>, or if we have <tt>W1=W*x_{i}*W3, W2=W*x_{j}*W4</tt> for some words <tt>W,W3,W4</tt> in <tt><X></tt> and some letters <tt>x_{i},x_{j}</tt> in <tt>X</tt> such that <tt>i<j</tt>. Thus, we have <tt>x_{1}>_{LEX}x_{2}>_{LEX}...>_{LEX}x_{n}</tt>. Note that "LEX" is not a word ordering on <tt><X></tt>. We define word orderings "LLEX", "ELIM" and "LRLEX" on <tt><X></tt> as follows. | ||
<itemize> | <itemize> | ||
− | <item> | + | <item>"LLEX": for two words <tt>W1, W2</tt> in <tt><X></tt>, we say <tt>W1>_{LLEX}W2</tt> if <tt>len(W1)>len(W2)</tt>, or <tt>len(W1)=len(W2)</tt> and <tt>W1</tt> is lexicographically larger than <tt>W2</tt>.</item> |
+ | |||
+ | <item>"ELIM": it first compares the associated commutative terms lexicographically and then breaks ties using the non-commutative lexicographic ordering with respect to <tt>x_{1}>_{LEX}...>_{LEX}x_{n}</tt>. That is, for two words <tt>W1, W2</tt> in <tt><X></tt>, we say <tt>W1>_{ELIM}W2</tt> if <tt>W1</tt> is lexicographically larger than <tt>W2</tt> by considering them as two terms in the commutative case, or <tt>W1=W2</tt> by considering them as two terms in the commutative case and <tt>W1>_{Lex}W2</tt> where "LEX" is the non-commutative left-to-right lexicographic ordering. Thus, the elimination ordering "ELIM" first eliminates the letter <tt>x_{1}</tt>, and then <tt>x_{2}</tt>, and then <tt>x_{3}</tt>, and so on and so forth.</item> | ||
+ | |||
+ | <item>"LRLEX": we say <tt>W>_{LRLEX}W'</tt> if <tt>len(W)>len(W')</tt>, or <tt>len(W)=len(W')</tt> and <tt>W</tt> is larger than <tt>W'</tt> by the non-commutative right-to-left lexicographic ordering.</item> | ||
</itemize> | </itemize> | ||
− | + | A word ordering on is said to be <em>length compatible</em> if <tt>len(W1)>len(W2)</tt> implies <tt>W1</tt> is larger than <tt>W2</tt> for all <tt>W1, W2</tt> in <tt><X></tt>. For instance, "LLEX" and "LRLEX" are length compatible while "ELIM" is not. | |
+ | <par/> | ||
+ | Note that each word ordering is induced by the order of letters in X (see <ref>ApCoCoA-1:NCo.SetX|NCo.SetX</ref>). For instance, | ||
+ | NCo.SetX("abcdef"); | ||
+ | NCo.SetOrdering("ELIM"); | ||
+ | defines an elimination ordering induced by a>b>b>d>e>f. | ||
<itemize> | <itemize> | ||
− | <item>< | + | <item>@param <em>Ordering</em>: a STRING, which indicates a word ordering. For the time being, the package supports "LLEX" (the length-lexicographic ordering), "ELIM" (an elimination ordering), and "LRLEX" (the length-reverse-lexicographic ordering).</item> |
− | |||
− | |||
</itemize> | </itemize> | ||
− | |||
<example> | <example> | ||
NCo.RingEnv(); | NCo.RingEnv(); | ||
Line 24: | Line 33: | ||
Ordering : LLEX | Ordering : LLEX | ||
------------------------------- | ------------------------------- | ||
− | NCo.SetOrdering( | + | NCo.SetOrdering("ELIM"); |
NCo.RingEnv(); | NCo.RingEnv(); | ||
Coefficient ring : Q | Coefficient ring : Q | ||
Line 32: | Line 41: | ||
</description> | </description> | ||
<seealso> | <seealso> | ||
− | <see>NCo. | + | <see>ApCoCoA-1:NCo.SetX|NCo.SetX</see> |
− | |||
</seealso> | </seealso> | ||
<types> | <types> | ||
Line 41: | Line 49: | ||
<key>NCo.SetOrdering</key> | <key>NCo.SetOrdering</key> | ||
<key>SetOrdering</key> | <key>SetOrdering</key> | ||
− | <wiki-category>Package_gbmr</wiki-category> | + | <wiki-category>ApCoCoA-1:Package_gbmr</wiki-category> |
</command> | </command> |
Latest revision as of 13:44, 29 October 2020
This article is about a function from ApCoCoA-1. |
NCo.SetOrdering
Set a word ordering on <X>.
Syntax
NCo.SetOrdering(Ordering:STRING)
Description
Note that a word ordering is a well-ordering which is compatible with multiplication. The default ordering is "LLEX" (the length-lexicographic ordering).
Let X={x_{1}x_{2}...x_{n}}. We define the non-commutative (left-to-right) lexicographic ordering "LEX" on <X> as follows. For two words W1, W2 in <X>, we say W1>_{Lex}W2 if we have W1=W2*W for some non-empty word W in <X>, or if we have W1=W*x_{i}*W3, W2=W*x_{j}*W4 for some words W,W3,W4 in <X> and some letters x_{i},x_{j} in X such that i<j. Thus, we have x_{1}>_{LEX}x_{2}>_{LEX}...>_{LEX}x_{n}. Note that "LEX" is not a word ordering on <X>. We define word orderings "LLEX", "ELIM" and "LRLEX" on <X> as follows.
"LLEX": for two words W1, W2 in <X>, we say W1>_{LLEX}W2 if len(W1)>len(W2), or len(W1)=len(W2) and W1 is lexicographically larger than W2.
"ELIM": it first compares the associated commutative terms lexicographically and then breaks ties using the non-commutative lexicographic ordering with respect to x_{1}>_{LEX}...>_{LEX}x_{n}. That is, for two words W1, W2 in <X>, we say W1>_{ELIM}W2 if W1 is lexicographically larger than W2 by considering them as two terms in the commutative case, or W1=W2 by considering them as two terms in the commutative case and W1>_{Lex}W2 where "LEX" is the non-commutative left-to-right lexicographic ordering. Thus, the elimination ordering "ELIM" first eliminates the letter x_{1}, and then x_{2}, and then x_{3}, and so on and so forth.
"LRLEX": we say W>_{LRLEX}W' if len(W)>len(W'), or len(W)=len(W') and W is larger than W' by the non-commutative right-to-left lexicographic ordering.
A word ordering on is said to be length compatible if len(W1)>len(W2) implies W1 is larger than W2 for all W1, W2 in <X>. For instance, "LLEX" and "LRLEX" are length compatible while "ELIM" is not.
Note that each word ordering is induced by the order of letters in X (see NCo.SetX). For instance,
NCo.SetX("abcdef"); NCo.SetOrdering("ELIM");
defines an elimination ordering induced by a>b>b>d>e>f.
@param Ordering: a STRING, which indicates a word ordering. For the time being, the package supports "LLEX" (the length-lexicographic ordering), "ELIM" (an elimination ordering), and "LRLEX" (the length-reverse-lexicographic ordering).
Example
NCo.RingEnv(); Coefficient ring : Q Ordering : LLEX ------------------------------- NCo.SetOrdering("ELIM"); NCo.RingEnv(); Coefficient ring : Q Ordering : ELIM -------------------------------
See also