Search results

From ApCoCoAWiki
  • <short_description>Computes reduced Groebner basis of a D-ideal in Weyl algebra <tt>A_n</tt>.</short_description> ...t a Groebner basis then the output will not be the reduced Groebner basis. In fact, this function reduces a list <tt>GB</tt> of Weyl polynomials using <r
    2 KB (330 words) - 10:40, 7 October 2020
  • <short_description>Transforms a border basis into a Groebner basis.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    2 KB (331 words) - 09:43, 7 October 2020
  • <short_description>Reduced Groebner basis of an ideal <tt>I</tt> in Weyl algebra <tt>A_n</tt>.</short_description> ...ynomials in the list <tt>L</tt> and leading coefficient of each polynomial in <tt>L</tt> is 1.
    3 KB (386 words) - 10:39, 7 October 2020
  • <short_description>Computing a Groebner Basis of a given ideal intersected with <tt>x^2-x</tt> for all indeterminates <tt ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    2 KB (355 words) - 09:55, 7 October 2020
  • <short_description>Transforms a Groebner basis into a border basis.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (395 words) - 09:43, 7 October 2020
  • <short_description>Computing a Groebner Basis of a given ideal in <tt>F_2</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (346 words) - 09:54, 7 October 2020
  • <short_description>compute reduced Groebner basis</short_description> components form a reduced Groebner basis for M with respect to the
    1 KB (231 words) - 10:02, 24 October 2007
  • <short_description>calculate a Groebner basis</short_description> components form a Groebner basis for M with respect to the
    2 KB (302 words) - 10:02, 24 October 2007
  • <short_description>Computing a Groebner Basis of a given ideal in <tt>F_512</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (384 words) - 09:55, 7 October 2020
  • <short_description>Computing a Groebner Basis of a given ideal in <tt>F_128</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (387 words) - 09:54, 7 October 2020
  • <short_description>Computing a Groebner Basis of a given ideal in <tt>F_4</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (387 words) - 09:55, 7 October 2020
  • <short_description>Computes a Border Basis of a given ideal over <tt>F_2</tt>. </short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    2 KB (309 words) - 09:53, 7 October 2020
  • <short_description>Computing a Groebner Basis of a given ideal in <tt>F_16</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (386 words) - 09:54, 7 October 2020
  • <short_description>Computing a Groebner Basis of a given ideal in <tt>F_8</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (387 words) - 09:55, 7 October 2020
  • <short_description>Computing a Groebner Basis of a given ideal in <tt>F_32</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (387 words) - 09:54, 7 October 2020
  • <short_description>Computing a Groebner basis of a given ideal in <tt>F_1024</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (387 words) - 09:53, 7 October 2020
  • <short_description>Computing a Groebner Basis of a given ideal in <tt>F_2048</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (389 words) - 09:54, 7 October 2020
  • <short_description>Computing a Groebner Basis of a given ideal in <tt>F_256</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (391 words) - 09:54, 7 October 2020
  • ...n</tt> in to its reduced Groebner Basis using corresponding implementation in ApCoCoALib.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    4 KB (571 words) - 10:39, 7 October 2020
  • ...putes the reduced two-sided Groebner basis of a two-sided ideal <tt>I</tt> in the Weyl algebra <tt>A_n</tt> over the field of positive characteristic.</s ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (472 words) - 10:38, 7 October 2020
  • <short_description>Computing a Groebner Basis of a given ideal in <tt>F_64</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    3 KB (378 words) - 09:55, 7 October 2020
  • In the first two forms this function computes the syzygy module of a list of polynomials or vectors. In the last form this function returns the
    2 KB (258 words) - 10:02, 24 October 2007
  • <short_description>compute a Groebner basis with a timeout</short_description> ERROR: Time expired: use $gb.Complete to complete the computation
    1 KB (162 words) - 10:02, 24 October 2007
  • to be that of I or N, respectively. <tt>Res</tt> only works in the homogeneous context, and the coefficient ring
    1 KB (220 words) - 10:02, 24 October 2007
  • ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...nction does not find any zero. In this case the trivial solution is given. To solve linear systems naive Gaußian elimination is used.
    3 KB (402 words) - 09:56, 7 October 2020
  • <short_description>Computes the Groebner basis of an ideal <tt>I</tt> in Weyl algebra <tt>A_n</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    5 KB (749 words) - 10:38, 7 October 2020
  • <short_description>Computes a Border Basis of a given ideal over <tt>F_2</tt>. </short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    4 KB (536 words) - 09:56, 7 October 2020
  • <short_description>Computes a Border Basis of a given ideal over <tt>F_2</tt>. </short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
    4 KB (655 words) - 09:55, 7 October 2020
  • ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...find any zero. In this case a massage for non-uniqueness will be displayed to the screen after reaching the maximum degree bound.
    5 KB (694 words) - 09:57, 7 October 2020
  • = Introduction = ...polynomials, ideals and modules are added to provide an intuitive approach to the algebraic nature of the functions.
    7 KB (1,071 words) - 12:02, 13 September 2019
  • ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...find any zero. In this case a massage for non-uniqueness will be displayed to the screen after reaching the maximum degree bound.
    6 KB (899 words) - 09:56, 7 October 2020
  • ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...n. In sparse case it uses <ref>ApCoCoA-1:Slinalg.SEF|Slinalg.SEF</ref> and in dense case it uses <ref>ApCoCoA-1:LinAlg.EF|LinAlg.EF</ref>.
    7 KB (905 words) - 09:57, 7 October 2020
  • ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...s will be displayed to the screen after reaching the maximum degree bound. In fact Mutant NLA-Algorithm is the NLA-Algorithm with mutant strategy. It use
    8 KB (1,077 words) - 09:56, 7 October 2020
  • ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...find any zero. In this case a massage for non-uniqueness will be displayed to the screen after reaching the maximum degree bound.
    8 KB (1,094 words) - 09:56, 7 October 2020
  • ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...s will be displayed to the screen after reaching the maximum degree bound. In fact Improved Mutant NLA-Algorithm is the NLA-Algorithm with improved mutan
    8 KB (1,140 words) - 09:56, 7 October 2020