polynomial division a/b, ignoring the rest via singclap_pdivide resp. idLift destroyes a,b
69 ideal vi=
idInit(1,1); vi->m[0]=q;
70 ideal ui=
idInit(1,1); ui->m[0]=
p;
110 for(
i=comps-1;
i>=0;
i--)
127 ideal vi=
idInit(1,1); vi->m[0]=q;
128 ideal ui=
idInit(1,1); ui->m[0]=I->m[
i];
165 WerrorS(
"division over a coefficient domain only implemented for terms");
BOOLEAN convSingTrP(poly p, const ring r)
poly singclap_pdivide(poly f, poly g, const ring r)
@ n_transExt
used for all transcendental extensions, i.e., the top-most extension in an extension tower is transce...
void WerrorS(const char *s)
ideal idLift(ideal mod, ideal submod, ideal *rest, BOOLEAN goodShape, BOOLEAN isSB, BOOLEAN divide, matrix *unit, GbVariant alg)
represents the generators of submod in terms of the generators of mod (Matrix(SM)*U-Matrix(rest)) = M...
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
#define MATELEM(mat, i, j)
1-based access to matrix
CanonicalForm ndConvSingNFactoryN(number, BOOLEAN, const coeffs)
#define SI_RESTORE_OPT1(A)
poly p_DivideM(poly a, poly b, const ring r)
static poly p_Add_q(poly p, poly q, const ring r)
static void p_SetCompP(poly p, int i, ring r)
static unsigned long p_SetComp(poly p, unsigned long c, ring r)
static long p_MaxComp(poly p, ring lmRing, ring tailRing)
static void p_Delete(poly *p, const ring r)
void rChangeCurrRing(ring r)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
static n_coeffType rFieldType(const ring r)
the type of the coefficient filed of r (n_Zp, n_Q, etc)
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
static BOOLEAN rIsNCRing(const ring r)
#define rField_is_Ring(R)
ideal idInit(int idsize, int rank)
initialise an ideal / module
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
matrix id_Module2formatedMatrix(ideal mod, int rows, int cols, const ring R)