17poly
maIMap(ring src_ring, ring dst_ring, poly
p);
19void maFindPerm(
char const *
const *
const preim_names,
int preim_n,
char const *
const *
const preim_par,
int preim_p,
20 char const *
const *
const names,
int n,
char const *
const *
const par,
int nop,
23void maFindPermLP(
char const *
const *
const preim_names,
int preim_n,
char const *
const *
const preim_par,
int preim_p,
24 char const *
const *
const names,
int n,
char const *
const *
const par,
int nop,
26void maFetchPermLP(
const ring preimage_r,
const ring dst_r,
int * perm);
CanonicalForm map(const CanonicalForm &primElem, const Variable &alpha, const CanonicalForm &F, const Variable &beta)
map from to such that is mapped onto
Coefficient rings, fields and other domains suitable for Singular polynomials.
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
const CanonicalForm int s
const Variable & v
< [in] a sqrfree bivariate poly
poly pSubstPoly(poly p, int var, poly image)
poly maIMap(ring src_ring, ring dst_ring, poly p)
poly maEval(map theMap, poly p, ring preimage_r, nMapFunc nMap, ideal s, const ring dst_r)
void maFetchPermLP(const ring preimage_r, const ring dst_r, int *perm)
ideal idSubstPoly(ideal id, int n, poly e)
map maCopy(map theMap, const ring dst_ring)
int maMaxDeg_P(poly p, ring preimage_r)
void maFindPerm(char const *const *const preim_names, int preim_n, char const *const *const preim_par, int preim_p, char const *const *const names, int n, char const *const *const par, int nop, int *perm, int *par_perm, n_coeffType ch)
void maFindPermLP(char const *const *const preim_names, int preim_n, char const *const *const preim_par, int preim_p, char const *const *const names, int n, char const *const *const par, int nop, int *perm, int *par_perm, n_coeffType ch, int lV)
poly maEvalVariable(poly p, int v, int pExp, ideal s, const ring dst_r)
int maMaxDeg_Ma(ideal a, ring preimage_r)
poly p_MinPolyNormalize(poly p, const ring r)