Search results

Page title matches

• HowTo:Term Orderings
  ...this topic, we assume that the reader is familiar with the concept of term orderings on polynomial rings. ...<math>t_1 \leq_\sigma t_2</math>. Then <math>\sigma</math> is called a '''term ordering''' on '''''T(P)''''' iff it is multiplicative, i.e. <math>t_1 \leq
  8 KB (1,311 words) - 11:26, 14 February 2021

Page text matches

• CoCoA:LexMat
  <short_description>matrices for std. term-orderings</short_description> This function return the matrix defining a standard term-ordering.
  650 bytes (66 words) - 10:02, 24 October 2007
• CoCoA:XelMat
  <short_description>matrices for std. term-orderings</short_description> This function return the matrix defining a standard term-ordering.
  584 bytes (59 words) - 10:02, 24 October 2007
• CoCoA:DegLexMat
  <short_description>matrices for std. term-orderings</short_description> This function return the matrix defining a standard term-ordering.
  593 bytes (59 words) - 10:02, 24 October 2007
• CoCoA:DegRevLexMat
  <short_description>matrices for std. term-orderings</short_description> This function return the matrix defining a standard term-ordering.
  604 bytes (61 words) - 10:02, 24 October 2007
• CoCoA:RevLexMat
  <short_description>matrices for std. term-orderings</short_description> not a term-ordering!).
  620 bytes (67 words) - 10:02, 24 October 2007
• CoCoA:Ord
  <short_description>matrix defining a term-ordering</short_description> The first two forms return matrices which describe the term-ordering
  2 KB (207 words) - 10:02, 24 October 2007
• CoCoA:IsTermOrdering
  <short_description>check if a matrix defines a term-ordering</short_description> This function determines whether a square matrix defines a term-ordering,
  754 bytes (78 words) - 10:02, 24 October 2007
• CoCoA:LT
  <short_description>the leading term of an object</short_description> If E is a polynomial this function returns the leading term of the
  2 KB (288 words) - 10:02, 24 October 2007
• CoCoA:Elim
  used when constructing a ring (see <ttref>Orderings</ttref> and <ref>Predefined Term-Orderings</ref>).
  2 KB (260 words) - 10:02, 24 October 2007
• ApCoCoALib:PPMonoidModSquares
  This method creates a new PPMonoidModSquares with the given symbols and a term ordering (either Lex,DegRevLex or DegLex) ...ings are isomorphic, although the representing matrices differ. also a lex term ordering with z<x<y (or other permutations or similar variations of DegLex
  2 KB (349 words) - 15:42, 21 October 2007
• ApCoCoA-1:DA.DiffTO
  <short_description>Matrix corresponding to predefined differential term orderings.</short_description> This function returns the matrix corresponding to the indicated term ordering <tt>D</tt>.
  1 KB (238 words) - 13:29, 29 October 2020
• HowTo:Term Orderings
  ...this topic, we assume that the reader is familiar with the concept of term orderings on polynomial rings. ...<math>t_1 \leq_\sigma t_2</math>. Then <math>\sigma</math> is called a '''term ordering''' on '''''T(P)''''' iff it is multiplicative, i.e. <math>t_1 \leq
  8 KB (1,311 words) - 11:26, 14 February 2021
• Package sagbi/SB.GetTruncDeg
  <see>HowTo:Term Orderings</see>
  2 KB (265 words) - 13:21, 29 October 2020
• Package sagbi/SB.GetTruncSAGBI
  <see>HowTo:Term Orderings</see>
  2 KB (278 words) - 13:21, 29 October 2020
• Package sagbi/SB.GetSAGBI
  <see>HowTo:Term Orderings</see>
  2 KB (271 words) - 13:21, 29 October 2020
• ApCoCoA-1:NCo.MRLW
  The leading word (or term) of a polynomial in a finitely presented monoid ring. ...y letter in X MUST appear only once.The order of letters in X induces word orderings.</item>
  3 KB (524 words) - 13:42, 29 October 2020
• CoCoA:GBasis5, and more
  orderings, gradings... M := $cocoa5.AddParamOrdMat(DegRevLexMat(3), 1); // compatible Term Ordering
  4 KB (504 words) - 10:02, 24 October 2007
• Package sagbi
  Let <math>\sigma</math> be a [[HowTo:Term Orderings|term ordering]] on <math>P</math> and let <math>S</math> be a <math>K</math>-sub ...e a set of non-zero polynomials. Furthermore, let <math>\sigma</math> be a term ordering on <math>\mathbb{T}^n</math>.
  12 KB (2,168 words) - 20:21, 8 November 2020