Home Online Manual
Top
Back: recursive_from_boolean_poly
Forward: from_boolean_set
FastBack:
FastForward:
Up: polybori_lib
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.14.4.13 from_boolean_ideal

Procedure from library polybori.lib (see polybori_lib).

Usage:
from_boolean_ideal(I); I boolean ideal

Return:
ideal in Singular

Example:
 
LIB "polybori.lib";
ring rs=0,(x,y,z),Dp;
def rb3=boolean_poly_ring(rs);
poly f1=x+y;
poly f2=x+z;
bpoly pp =f1;
bpoly p = f2;
bideal Ib;
list K=(p,pp);
Ib=K;
from_boolean_ideal(Ib);
==> _[1]=x+z
==> _[2]=x+y
ring rs2=5,(x,y,z),Dp;
def rb4=boolean_poly_ring(rs2);
poly p1=x+y;
poly p2=x+z;
poly p3=y+z;
bpoly p = p1;
==> // ** redefining p (bpoly p = p1;) ./examples/from_boolean_ideal.sing:17
bpoly pp = p2;
==> // ** redefining pp (bpoly pp = p2;) ./examples/from_boolean_ideal.sing:1\
   8
bpoly ppp = p3;
bideal Ib;
==> // ** redefining Ib (bideal Ib;) ./examples/from_boolean_ideal.sing:20
list K=(p,pp,ppp);
==> // ** redefining K (list K=(p,pp,ppp);) ./examples/from_boolean_ideal.sin\
   g:21
Ib=K;
from_boolean_ideal(Ib);
==> _[1]=x+y
==> _[2]=x+z
==> _[3]=y+z
See also: boolean_ideal; boolean_poly; boolean_poly_ring; boolean_std; from_boolean_poly.