Difference between revisions of "ApCoCoA-1:NCo.Add"
| Line 10: | Line 10: | ||
<em>Please note:</em> The function(s) explained on this page is/are using the <em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. | <em>Please note:</em> The function(s) explained on this page is/are using the <em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. | ||
<par/> | <par/> | ||
| − | Please set ring environment <em>coefficient field</em> <tt>K</tt>, <em>alphabet</em> (or set of indeterminates) <tt>X</tt> and <em>ordering</em> via the functions <ref>NCo.SetFp</ref>, <ref>NCo.SetX</ref> and <ref>NCo.SetOrdering</ref>, respectively, before | + | Please set ring environment <em>coefficient field</em> <tt> K</tt>, <em>alphabet</em> (or set of indeterminates) <tt>X</tt> and <em>ordering</em> via the functions <ref>NCo.SetFp</ref>, <ref>NCo.SetX</ref> and <ref>NCo.SetOrdering</ref>, respectively, before using this function. The default coefficient field is <tt>Q</tt>, and the default ordering is the length-lexicographic ordering (<quotes>LLEX</quotes>). For more information, please check the relevant functions. |
<itemize> | <itemize> | ||
| − | <item>@param <em>F1, F2:</em> two polynomials in <tt>K<X></tt>, which are left and right operands of addition respectively. Each polynomial is represented as a LIST of monomials, which are | + | <item>@param <em>F1, F2:</em> two polynomials in <tt>K<X></tt>, which are left and right operands of addition respectively. Each polynomial is represented as a LIST of monomials, which are LISTs of the form [C, W] where W is a word in <tt><X></tt> and C is the coefficient of W. For example, the polynomial <tt>f=xy-y+1</tt> is represented as F:=[[1,<quotes>xy</quotes>], [-1, <quotes>y</quotes>], [1,<quotes></quotes>]]. The zero polynomial <tt>0</tt> is represented as the empty LIST [].</item> |
| − | <item>@return: a LIST which represents the polynomial equal to <tt>F1+F2</tt>.</item> | + | <item>@return: a LIST, which represents the polynomial equal to <tt>F1+F2</tt>.</item> |
</itemize> | </itemize> | ||
<example> | <example> | ||
Revision as of 16:09, 29 April 2013
NCo.Add
Addition of two polynomials in a free monoid ring.
Syntax
NCo.Add(F1:LIST, F2:LIST):LIST
Description
Please note: The function(s) explained on this page is/are using the ApCoCoAServer. You will have to start the ApCoCoAServer in order to use it/them.
Please set ring environment coefficient field K, alphabet (or set of indeterminates) X and ordering via the functions NCo.SetFp, NCo.SetX and NCo.SetOrdering, respectively, before using this function. The default coefficient field is Q, and the default ordering is the length-lexicographic ordering ("LLEX"). For more information, please check the relevant functions.
@param F1, F2: two polynomials in K<X>, which are left and right operands of addition respectively. Each polynomial is represented as a LIST of monomials, which are LISTs of the form [C, W] where W is a word in <X> and C is the coefficient of W. For example, the polynomial f=xy-y+1 is represented as F:=[[1,"xy"], [-1, "y"], [1,""]]. The zero polynomial 0 is represented as the empty LIST [].
@return: a LIST, which represents the polynomial equal to F1+F2.
Example
NCo.SetX(<quotes>abc</quotes>); NCo.SetOrdering(<quotes>ELIM</quotes>); NCo.RingEnv(); Coefficient ring : Q Alphabet : abc Ordering : ELIE ------------------------------- F1 := [[1,<quotes>a</quotes>],[1,<quotes></quotes>]]; F2 := [[1,<quotes>b</quotes>],[1,<quotes>ba</quotes>]]; NCo.Add(F1,F2); -- over Q [[1, <quotes>ba</quotes>], [1, <quotes>a</quotes>], [1, <quotes>b</quotes>], [1, <quotes></quotes>]] ------------------------------- NCo.SetFp(); -- set default Fp = F2 NCo.RingEnv(); Coefficient ring : Fp = Z/(2) Alphabet : abc Ordering : ELIM ------------------------------- NCo.Add(F1,F2); -- over F2 [[1, <quotes>ba</quotes>], [1, <quotes>a</quotes>], [1, <quotes>b</quotes>], [1, <quotes></quotes>]] ------------------------------- NCo.Add(F1,F1); -- over F2 [ ] -------------------------------
See also
