 |
My Project
UNKNOWN_GIT_VERSION
|
Go to the source code of this file.
|
ideal | maMapIdeal (const ideal map_id, const ring map_r, const ideal image_id, const ring image_r, const nMapFunc nMap) |
| polynomial map for ideals/module/matrix map_id: the ideal to map map_r: the base ring for map_id image_id: the image of the variables image_r: the base ring for image_id nMap: map for coeffcients More...
|
|
poly | p_SubstPoly (poly p, int var, poly image, const ring preimage_r, const ring image_r, const nMapFunc nMap, matrix cache=NULL) |
|
ideal | id_SubstPoly (ideal id, int var, poly image, const ring preimage_r, const ring image_r, const nMapFunc nMap) |
|
◆ id_SubstPoly()
ideal id_SubstPoly |
( |
ideal |
id, |
|
|
int |
var, |
|
|
poly |
image, |
|
|
const ring |
preimage_r, |
|
|
const ring |
image_r, |
|
|
const nMapFunc |
nMap |
|
) |
| |
◆ maMapIdeal()
polynomial map for ideals/module/matrix map_id: the ideal to map map_r: the base ring for map_id image_id: the image of the variables image_r: the base ring for image_id nMap: map for coeffcients
Definition at line 88 of file gen_maps.cc.
114 && (map_id->nrows==1)
115 && (map_id->rank==1))
128 if ((t==0) || (t>1)) sz_more++;
130 if (((sz_l > sz*2) && (sz_more != 1))||(sz<5))
140 int C=((
matrix)map_id)->cols();
141 int R=((
matrix)map_id)->rows();
143 int N = preimage_r->N;
146 for (
i=
R*C-1;
i>=0;
i--)
148 if (map_id->m[
i]!=
NULL)
150 m->m[
i]=
maEval((
map)image_id, map_id->m[
i], preimage_r, nMap, (ideal)cache, image_r);
156 ii->rank=((ideal)map_id)->rank;
◆ p_SubstPoly()
Definition at line 39 of file subst_maps.cc.
45 if((image_r!=preimage_r)
59 poly q=
p_SubstMon(
p,var,image,preimage_r,image_r,nMap,cache);
matrix ma_ApplyPermForMap(const matrix to_map, const ring preimage_r, const ideal image, const ring image_r, const nMapFunc nMap)
helper function for maMapIdeal mapping ideal/matrix/module for the case of a permutation: maps the id...
int maMaxDeg_Ma(ideal a, ring preimage_r)
#define idDelete(H)
delete an ideal
void sBucketDestroyAdd(sBucket_pt bucket, poly *p, int *length)
CanonicalForm map(const CanonicalForm &primElem, const Variable &alpha, const CanonicalForm &F, const Variable &beta)
map from to such that is mapped onto
number ndCopyMap(number a, const coeffs aRing, const coeffs r)
const CanonicalForm CFMap CFMap & N
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
static unsigned pLength(poly a)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
void PrintS(const char *s)
void sBucket_Add_p(sBucket_pt bucket, poly p, int length)
adds poly p to bucket destroys p!
sBucket_pt sBucketCreate(const ring r)
static void find_subst_for_map(const ring preimage_r, const ring image_r, const ideal image, int &var, poly &p)
int maMaxDeg_P(poly p, ring preimage_r)
matrix mpNew(int r, int c)
create a r x c zero-matrix
ideal fast_map_common_subexp(const ideal map_id, const ring map_r, const ideal image_id, const ring image_r)
poly p_SubstPoly(poly p, int var, poly image, const ring preimage_r, const ring image_r, const nMapFunc nMap, matrix cache)
ideal id_SubstPoly(ideal id, int var, poly image, const ring preimage_r, const ring image_r, const nMapFunc nMap)
void WerrorS(const char *s)
static poly p_SubstMon(poly p, int var, poly image, const ring preimage_r, const ring image_r, const nMapFunc nMap, matrix cache)
#define pCopy(p)
return a copy of the poly
poly maEval(map theMap, poly p, ring preimage_r, nMapFunc nMap, ideal s, const ring dst_r)