|
|
D.14.4.6 recursive_boolean_poly
Procedure from library polybori.lib (see polybori_lib).
- Usage:
- boolean_poly(ps[, rb]); ps polynomial, rb boolean ring
- Return:
- default: polynomial ps in the representation of the boolean ring
rb==boolean_poly_ring(basering); optional input: rb boolean ring
Example:
| | LIB "polybori.lib";
==> // ** args must be 1 in system("install", "bideal", "ideal", bid\
eal2ideal, 4);
ring r0=2,x(1..4),lp;
poly f=x(1)^2+2*x(2)*(x(3))-x(4)^3;
recursive_boolean_poly(f);
==> x(1) + x(4)
ring r1=0,x,Dp;
poly f=x3+2x+1;
recursive_boolean_poly(f);
==> x + 1
ring r2=32003,(x,y,z),Dp;
def br2=boolean_poly_ring(r2);
bring bbr2=r2;
poly f=xyz+20*x^2*y-3*xz+15;
recursive_boolean_poly(f,br2);
==> x*y*z + x*z + 1
recursive_boolean_poly(f,bbr2);
==> x*y*z + x*z + 1
|
See also:
boolean_ideal;
boolean_std.
|
Online Manual
