Difference between revisions of "Main Page/Applications"

From ApCoCoAWiki
(Added simple syntax highlighting)
(simplified sagbi example)
 
Line 7: Line 7:
  
 
Computing reduced [[Package sagbi|SAGBI bases]]:
 
Computing reduced [[Package sagbi|SAGBI bases]]:
  <span style="color:blue">Use</span> QQ[x,y], <span style="color:red">DegLex</span>;
+
  <span style="color:blue">Use</span> P ::= QQ[x,y,z], <span style="color:red">DegLex</span>;
  SB.SAGBI([x^2*y, x^2 -y^2, x^2*y^2 -y^4, x^2*y^4]);
+
  S := SB.Subalgebra(P,[y-x^2,z-x^3]);
  <span style="color:#777777">-- reduced DegLex-SAGBI basis of Q[x^2y, x^2-y^2, x^2y^2-y^4, x^2y^4]</span>
+
  SB.SAGBI(S); <span style="color:#777777">-- reduced DegLex-SAGBI basis of S</span>
  
 
Solving polynomial equations over <math>\mathbb{Z}/2\mathbb{Z}</math> using a SAT solver:
 
Solving polynomial equations over <math>\mathbb{Z}/2\mathbb{Z}</math> using a SAT solver:

Latest revision as of 14:29, 29 October 2020

Application Examples

Computing reduced Gröbner bases:

Use P ::= QQ[x,y,z], DegRevLex;
I := ideal(P,[y-x^2,z-x^3]);
GBasis(I); -- reduced DegRevLex Gröbner basis of I

Computing reduced SAGBI bases:

Use P ::= QQ[x,y,z], DegLex;
S := SB.Subalgebra(P,[y-x^2,z-x^3]);
SB.SAGBI(S); -- reduced DegLex-SAGBI basis of S

Solving polynomial equations over using a SAT solver:

Use ZZ/(2)[x,y,z];
f1 := x*y + x*z + y*z + z;
f2 := y + 1;
f3 := x*y + z;
SAT.Solve([f1,f2,f3]); -- [0, 1, 0]