Search results
From ApCoCoAWiki
- <short_description>Complete an interactive Groebner-type calculation</short_description> <type>groebner</type>559 bytes (64 words) - 10:02, 24 October 2007
- IMPORTANT: the only exception to the type of M or N (or even of the In these cases their type is indeed MOD.4 KB (615 words) - 10:02, 24 October 2007
- Type(It); <type>ring</type>578 bytes (68 words) - 10:02, 24 October 2007
- ...m of <tt>M</tt> mod <tt>P</tt> and the components of <tt>M</tt> must be of type <tt>INT</tt>. ...nts of <tt>M</tt> must be of type <tt>INT</tt>. Otherwise, they must be of type <tt>ZMOD</tt>.</item>3 KB (467 words) - 10:11, 7 October 2020
- ...m of <tt>M</tt> mod <tt>P</tt> and the components of <tt>M</tt> must be of type <tt>INT</tt>. ...given, the components of M must be of type INT. Otherwise, they must be of type ZMOD.</item>3 KB (452 words) - 10:09, 7 October 2020
- ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>apcocoaserver</type>2 KB (259 words) - 15:05, 1 November 2020
- If Type(A)<>INT OR Type(B)<>INT Then1 KB (218 words) - 20:13, 17 July 2008
- <short_description>status of an interactive Groebner-type calculation</short_description> <type>groebner</type>618 bytes (75 words) - 10:02, 24 October 2007
- This function returns TRUE if E has type INT, RAT, or ZMOD. <type>boolean</type>627 bytes (73 words) - 10:02, 24 October 2007
- ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>poly</type>2 KB (275 words) - 15:30, 1 November 2020
- <short_description>take one step in an interactive Groebner-type calculation</short_description> <type>groebner</type>589 bytes (74 words) - 10:02, 24 October 2007
- <short_description>take steps in an interactive Groebner-type calculation</short_description> <type>groebner</type>595 bytes (75 words) - 10:02, 24 October 2007
- where M is skew-symmetric. The resulting type depends on the entries <type>matrix</type>519 bytes (65 words) - 10:02, 24 October 2007
- ...m of <tt>M</tt> mod <tt>P</tt> and the components of <tt>M</tt> must be of type <tt>INT</tt>. ...t>M</tt> must be of type <tt>INT</tt>. Otherwise, they must be castable to type <tt>RAT</tt> or <tt>ZMOD</tt> (please see description above).</item>4 KB (566 words) - 13:33, 29 October 2020
- ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>apcocoaserver</type>2 KB (308 words) - 15:17, 1 November 2020
- ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>apcocoaserver</type>2 KB (308 words) - 15:14, 1 November 2020
- If Type(N) <> INT Then Error(<quotes>Argument must be an integer.</quotes>) E <type>error</type>770 bytes (95 words) - 10:02, 24 October 2007
- of almost any type for which <em>zero</em> makes sense. <type>boolean</type>959 bytes (112 words) - 10:02, 24 October 2007
- ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>list</type>2 KB (298 words) - 15:31, 1 November 2020
- <item>@param <em>M</em> A matrix with components either of type INT, ZMOD or RAT.</item> <item>@param <em>B</em> A matrix with components either of type INT, ZMOD or RAT.</item>2 KB (292 words) - 10:09, 7 October 2020
- ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>list</type>2 KB (333 words) - 15:34, 1 November 2020
- ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>list</type>2 KB (333 words) - 15:33, 1 November 2020
- Type(L); <type>io</type>662 bytes (83 words) - 10:02, 24 October 2007
- LT(E):same type as E where E has type IDEAL, MODULE, POLY, or VECTOR.2 KB (288 words) - 10:02, 24 October 2007
- Record[Type = IDEAL, Value = Record[Gens = [t^3 - x, t^4 - y]]] Record[Type = IDEAL, Value = Record[Gens = [t^3 - x, t^4 - y],2 KB (302 words) - 10:02, 24 October 2007
- ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>apcocoaserver</type>2 KB (306 words) - 15:09, 1 November 2020
- Polynomials</quotes>, it is enough to type: <quotes>?for poly</quotes>. <type>online-help</type>840 bytes (118 words) - 10:02, 24 October 2007
- where E has type LIST, MAT, or VECTOR. <type>list</type>867 bytes (113 words) - 10:02, 24 October 2007
- LM(P:POLY or VECTOR):same type as P <type>polynomial</type>776 bytes (106 words) - 10:02, 24 October 2007
- ...list of terms representing an order ideal. The second element has to be of type <tt>POLY</tt>.</item> <type>borderbasis</type>914 bytes (137 words) - 13:27, 29 October 2020
- ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>poly</type>2 KB (388 words) - 15:32, 1 November 2020
- <type>...</type> <type>...</type>8 KB (1,239 words) - 09:25, 26 October 2020
- Type(V); <type>vector</type>664 bytes (91 words) - 10:02, 24 October 2007
- <item>@param <em>M</em> A matrix with components either of type INT, ZMOD or RAT.</item> <item>@param <em>B</em> A matrix with components either of type INT, ZMOD or RAT.</item>3 KB (416 words) - 13:33, 29 October 2020
- ...list of terms representing an order ideal. The second element has to be of type <tt>POLY</tt>.</item> <type>borderbasis</type>926 bytes (151 words) - 13:27, 29 October 2020
- ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>apcocoaserver</type>3 KB (411 words) - 15:12, 1 November 2020
- // Add relations of the type a_{i}a_{i+2} = a_{i+2}a_{i} // Add relations of the type a_{i}a_{i+1}a_{i} = a_{i+1}a_{i}a_{i+1}2 KB (357 words) - 20:28, 22 April 2014
- .../em> A list of terms representing an order ideal. The second element is of type <tt>POLY</tt>.</item> <type>borderbasis</type>1 KB (160 words) - 09:41, 7 October 2020
- where E and F are of type BOOL. <type>boolean</type>794 bytes (128 words) - 10:02, 24 October 2007
- Type(F); <type>function</type>1 KB (163 words) - 10:02, 24 October 2007
- ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>poly</type>3 KB (450 words) - 15:24, 1 November 2020
- ...able. You can choose between INT or RAT for the type of each bound, if you type in a (empty) string, then it means minus infinity (first place) or plus inf <type>apcocoaserver</type>3 KB (447 words) - 13:32, 29 October 2020
- <item>@param <em>M</em> A matrix with components either of type <tt>INT</tt>, <tt>ZMOD</tt> or <tt>RAT</tt>.</item> <item>@param <em>B</em> A matrix with components either of type <tt>INT</tt>, <tt>ZMOD</tt> or <tt>RAT</tt>.</item>3 KB (473 words) - 13:33, 29 October 2020
- Type(5);925 bytes (122 words) - 09:44, 29 October 2020
- Record[Name = <quotes/>, Type = <quotes>OString</quotes>, Protocol = <quotes>CoCoAL</quotes>] <type>io</type>1 KB (175 words) - 10:02, 24 October 2007
- ...<em>X:</em> a finite alphabet (or set of indeterminates). It is of STRING type. Note that every letter in X MUST appear only once.The order of letters in <item>@param <em>Relations:</em> a finite set of relations. It is of LIST type. Each element in Relations is of the form [W1, W2], where W1 and W2 are wor3 KB (524 words) - 13:42, 29 October 2020
- ...<em>X:</em> a finite alphabet (or set of indeterminates). It is of STRING type. Note that every letter in X MUST appear only once.The order of letters in <item>@param <em>Relations:</em> a finite set of relations. It is of LIST type. Each element in Relations is of the form [W1, W2], where W1 and W2 are wor3 KB (524 words) - 13:42, 29 October 2020
- ...<em>X:</em> a finite alphabet (or set of indeterminates). It is of STRING type. Note that every letter in X MUST appear only once.The order of letters in <item>@param <em>Relations:</em> a finite set of relations. It is of LIST type. Each element in Relations is of the form [W1, W2], where W1 and W2 are wor3 KB (514 words) - 13:42, 29 October 2020
- ...on [[/SB.SAGBITimeout/]]. Given a positive integer <code>s</code>, one can type in === The Subalgebra Data Type ===12 KB (2,168 words) - 20:21, 8 November 2020
- ...<em>X:</em> a finite alphabet (or set of indeterminates). It is of STRING type. Note that every letter in X MUST appear only once.The order of letters in <item>@param <em>Relations:</em> a finite set of relations. It is of LIST type. Each element in Relations is of the form [W1, W2], where W1 and W2 are wor3 KB (516 words) - 13:41, 29 October 2020