Search results

From ApCoCoAWiki

  • Package glpk/GLPK.LPSolve
    ...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
  • Documentation Principles
    <type>...</type> <type>...</type>
    8 KB (1,239 words) - 09:25, 26 October 2020
  • CoCoA:Vector
    Type(V); <type>vector</type>
    664 bytes (91 words) - 10:02, 24 October 2007
  • ApCoCoA-1:LinAlg.Solve
    <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
  • ApCoCoA-1:BB.GenericBB
    ...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
  • ApCoCoA-1:GLPK.LPSolve
    ...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
  • ApCoCoA-1:Braid groups
    // 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
  • ApCoCoA-1:BB.LiftHomAS
    .../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
  • CoCoA:Not, And, Or
    where E and F are of type BOOL. <type>boolean</type>
    794 bytes (128 words) - 10:02, 24 October 2007
  • CoCoA:Function
    Type(F); <type>function</type>
    1 KB (163 words) - 10:02, 24 October 2007
  • Package glpk/GLPK.MIPSolve
    ...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
  • ApCoCoA-1:GLPK.MIPSolve
    ...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
  • ApCoCoA-1:LinBox.Solve
    <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
  • CoCoA:HowTo:Use Modular Numbers
    Type(5);
    925 bytes (122 words) - 09:44, 29 October 2020
  • CoCoA:OpenOString
    Record[Name = <quotes/>, Type = <quotes>OString</quotes>, Protocol = <quotes>CoCoAL</quotes>] <type>io</type>
    1 KB (175 words) - 10:02, 24 October 2007
  • ApCoCoA-1:NCo.MRLW
    ...<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 wor
    3 KB (524 words) - 13:42, 29 October 2020
  • ApCoCoA-1:NCo.MRNR
    ...<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 wor
    3 KB (524 words) - 13:42, 29 October 2020
  • ApCoCoA-1:NCo.MRLC
    ...<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 wor
    3 KB (514 words) - 13:42, 29 October 2020
  • Package sagbi
    ...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
  • ApCoCoA-1:NCo.MRDeg
    ...<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 wor
    3 KB (516 words) - 13:41, 29 October 2020
  • ApCoCoA-1:NCo.MRMultiply
    ...<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 wor
    3 KB (522 words) - 13:42, 29 October 2020
  • ApCoCoA-1:NCo.MRInterreduction
    ...<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 wor
    3 KB (550 words) - 13:41, 29 October 2020
  • ApCoCoA-1:NCo.MRAdd
    ...<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 wor
    3 KB (544 words) - 13:41, 29 October 2020
  • ApCoCoA-1:NCo.MRSubtract
    ...<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 wor
    4 KB (572 words) - 13:43, 29 October 2020
  • Package sagbi/SB.IsInSA
    <item>@param <tt>S</tt> A subalgebra, i.e. of type <tt>TAGGED("$apcocoa/sagbi.Subalgebra")</tt> </item> <type>subalgebra</type>
    1 KB (210 words) - 13:22, 29 October 2020
  • CoCoA:ScalarProduct
    where each of L and M is of type VECTOR or LIST <type>list</type>
    1,017 bytes (141 words) - 10:02, 24 October 2007
  • ApCoCoA-1:BB.LiftHomND
    .../em> A list of terms representing an order ideal. The second element is of type <tt>POLY</tt>.</item> <type>borderbasis</type>
    1 KB (195 words) - 09:42, 7 October 2020
  • CoCoA:GroebnerFramework5
    To start the Groebnerframework type in the following command: Type help for help and quit to exit
    3 KB (445 words) - 17:46, 20 October 2007
  • ApCoCoA-1:BB.Box
    Computes the box order ideal of type <tt>D=[D_1,..,D_N]</tt>. The input is a list of integers <tt>D</tt> of leng <type>borderbasis</type>
    1 KB (196 words) - 09:40, 7 October 2020
  • CoCoA:Len
    | type | length | <type>ideal</type>
    2 KB (187 words) - 10:02, 24 October 2007
  • CoCoA:Toric.CheckInput
    ERROR: generators must be of type: power-product - power-product <type>ideal</type>
    1 KB (183 words) - 10:02, 24 October 2007
  • Package sagbi/SB.IsInSA SAGBI
    <item>@param <tt>S</tt> A standard-graded subalgebra, i.e. of type <tt>TAGGED("$apcocoa/sagbi.Subalgebra")</tt> and the generators of f are ho <type>subalgebra</type>
    2 KB (234 words) - 13:22, 29 October 2020
  • ApCoCoA-1:NCo.MRIsGB
    ...<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 wor
    4 KB (665 words) - 13:42, 29 October 2020
  • ApCoCoA-1:BB.LiftAS
    ...OO</em> A list of terms representing an order ideal with second element of type <tt>POLY</tt>.</item> <type>borderbasis</type>
    2 KB (223 words) - 09:41, 7 October 2020
  • CoCoA:Monic
    CONTEXT: Cond(Type(X) = LIST, [Monic(A)|A IN X], IsZero(X), X, X / LC(X)) <type>list</type>
    1 KB (186 words) - 10:02, 24 October 2007
  • CoCoA:If
    of times. Note: be careful not to type <tt>Elseif</tt> by mistake (it has an <type>programming</type>
    1 KB (230 words) - 10:02, 24 October 2007
  • CoCoA:User Interface Guide Word Completion (4.4)
    If you want to enter it automatically whenever you type more than 3 non-whitespace characters check the entry Autocompleting in the ...e rejecting the completion by pressing Esc, Del or simply by continuing to type normally.
    4 KB (642 words) - 15:13, 15 October 2007
  • ApCoCoA-1:BB.LiftND
    .../em> A list of terms representing an order ideal. The second element is of type <tt>POLY</tt>.</item> <type>borderbasis</type>
    2 KB (242 words) - 09:42, 7 October 2020
  • CoCoA:Res
    where M is of type IDEAL or MODULE or TAGGED(<quotes>Quotient</quotes>). <type>groebner</type>
    1 KB (220 words) - 10:02, 24 October 2007
  • CoCoA:Max, Min
    <type>integer</type> <type>ideal</type>
    1 KB (208 words) - 10:02, 24 October 2007
  • CoCoA:Cond
    number of times. Note: be careful not to type <tt>Elseif</tt> by mistake (it <type>programming</type>
    2 KB (247 words) - 10:02, 24 October 2007
  • ApCoCoA-1:NCo.IsFinite
    ...e free associative <tt>K</tt>-algebra <tt>K&lt;X&gt;</tt>. It is of STRING type.</item> <type>apcocoaserver</type>
    2 KB (286 words) - 13:40, 29 October 2020
  • ApCoCoA-1:HowTo:Tips for developing (Ap)CoCoA with Eclipse
    ...to select a C++ project type for the ApCoCoALib and the "standard project type" for the ApCoCoAPackages. Moreover, in most cases, you simply want to check * Select the appropriate project type and name the project
    6 KB (896 words) - 09:43, 29 October 2020
  • CoCoA:Homogenized
    where T is of type IDEAL or POLY, or T is a LIST recursively <type>groebner</type>
    2 KB (237 words) - 10:02, 24 October 2007
  • ApCoCoA-1:NCo.SetRelations
    <item>@param <em>R:</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 wor <type>non_commutative</type>
    2 KB (257 words) - 13:44, 29 October 2020
  • ApCoCoA-1:Num.NumericalDerivative
    ...</tt> is considered to consist of two columns, ie., is considered to be of type <tt>Mat([[X_1,Y_1],...,[X_k, Y_k]])</tt>. <type>apcocoaserver</type>
    2 KB (299 words) - 10:29, 7 October 2020
  • CoCoA:Catch
    If Type(E) = ERROR Then <type>error</type>
    2 KB (309 words) - 10:02, 24 October 2007
  • CoCoA:Alias
    into a CoCoA session. However, it is inconvenient to have to type out <type>packages</type>
    2 KB (314 words) - 10:02, 24 October 2007
  • ApCoCoA-1:NCo.AdMatrix
    ...erminates) generating the free monoid <tt>K&lt;X&gt;</tt>. It is of STRING type.</item> <type>apcocoaserver</type>
    2 KB (277 words) - 13:36, 29 October 2020
  • CoCoA:BringIn
    So, if you want to map the generators of the ideal type <type>list</type>
    2 KB (284 words) - 10:02, 24 October 2007

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

Retrieved from "http://apcocoa.uni-passau.de/wiki/index.php?title=Special:Search"