Search results
From ApCoCoAWiki
- ...W^n</tt>, we define word orderings LLEX, ELIM, LRLEX, and DEGREVLEX on <tt>W^n</tt> as follows. ...tt>len(W)=len(W')</tt> and <tt>W</tt> is lexicographically larger than <tt>W'</tt>.</item>4 KB (639 words) - 13:36, 29 October 2020
- Use R ::= Q[x,y,z,w]; TensorMat(Mat([[1,-1],[2,-2],[3,-3]]),Mat([[x,y],[z,w]]));609 bytes (94 words) - 10:02, 24 October 2007
- <tt>w</tt> or <tt>W</tt> then it immediately erases the file S. D := OpenOFile(<quotes>my-test</quotes>,<quotes>w</quotes>); -- clear <quotes>my-test</quotes>1 KB (193 words) - 10:02, 24 October 2007
- ...ynomial in Weyl algebra <tt>A_n</tt> with respect to the weight vector <tt>W=(u_i,v_i)</tt>.</short_description> Weyl.Inw(P:POLY,W:LIST):POLY2 KB (364 words) - 10:35, 7 October 2020
- Use R ::= Q[x,y,z,w]; Homogenized(w, x^3-y);2 KB (237 words) - 10:02, 24 October 2007
- Use Q[x,y,z,w[3..5]], Weights([7, 4, 3, 1, 1, 1]); x - 7413431 w[4]^7 - 9162341 w[3]*w[4]*w[5]^5,4 KB (504 words) - 10:02, 24 October 2007
- <short_description>Retrieves polynomials from <tt>W'</tt>.</short_description> This command retrieves all polynomials from <tt>W'</tt>.1 KB (169 words) - 09:49, 7 October 2020
- BBSGen.NonStand(OO,BO,N,W); BBSGen.NonStand(OO:LIST,BO:LIST,N:INTEGER,W:MATRIX):LIST2 KB (250 words) - 09:50, 7 October 2020
- <short_description>Retrieves leading terms of polynomials of <tt>W'</tt>.</short_description> ...eves the leading terms of degree <tt>Degree</tt> of the polynomials of <tt>W'</tt>.2 KB (267 words) - 09:49, 7 October 2020
- BBSGen.Poldeg(F,OO,BO,N,W); BBSGen.Poldeg(F:POLY,OO:LIST,BO:LIST,N:INT,W:MAT):VECTOR;2 KB (229 words) - 09:51, 7 October 2020
- ...t>, 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 < ...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>4 KB (629 words) - 13:44, 29 October 2020
- ...we define deg_{W}(c_ij)=log(b_j)-log(t_i)=(u_1,...,u_m)=u in Z^m, where W is the grading matrix. W:=BBSGen.Wmat(OO,BO,N);1 KB (231 words) - 09:52, 7 October 2020
- ...[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,"xy1 KB (220 words) - 13:39, 29 October 2020
- ...[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,"xy2 KB (375 words) - 13:40, 29 October 2020
- Use R ::= Q[w,x,y,z]; I := Ideal(z^2-xy,xz^2+w^3);1,005 bytes (138 words) - 10:02, 24 October 2007
- BBSGen.NonStandPoly(OO,BO,W,N); BBSGen.NonStandPoly(OO:LIST,BO:LIST,W:MATRIX,N:INTEGER):LIST2 KB (342 words) - 09:50, 7 October 2020
- BBSGen.NonTriv(OO,BO,W,N); BBSGen.NonTriv(OO:LIST,BO:LIST,W:MATRIX,N:INT):LIST;2 KB (317 words) - 09:51, 7 October 2020
- ...>I</tt> in Weyl algebra <tt>A_n</tt> with respect to the weight vector <tt>W=(u_i,v_i)</tt>.</short_description> Weyl.InIw(I:IDEAL,W:LIST):IDEAL3 KB (530 words) - 13:50, 29 October 2020
- ...where <tt>s</tt> commutes with all <tt>x_i</tt> and <tt>y_i</tt>'s and <tt>w</tt> is redundant indeterminate used just to create internal structure of t <item>@return An ideal in <tt>A_s=QQ[x1, ..., xn,y1, ...,yn, s,w]</tt>.</item>3 KB (411 words) - 10:34, 7 October 2020
- ...[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,"xy2 KB (290 words) - 13:40, 29 October 2020
