maps.h File Reference

#include "coeffs/coeffs.h"
#include "polys/monomials/ring.h"

Go to the source code of this file.

Functions
poly	maEval (map theMap, poly p, ring preimage_r, nMapFunc nMap, ideal s, const ring dst_r)
map	maCopy (map theMap, const ring dst_ring)
poly	maIMap (ring src_ring, ring dst_ring, poly p)
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)
void	maFetchPermLP (const ring preimage_r, const ring dst_r, int *perm)
poly	pSubstPoly (poly p, int var, poly image)
ideal	idSubstPoly (ideal id, int n, poly e)
poly	p_MinPolyNormalize (poly p, const ring r)
int	maMaxDeg_P (poly p, ring preimage_r)
int	maMaxDeg_Ma (ideal a, ring preimage_r)
poly	maEvalVariable (poly p, int v, int pExp, ideal s, const ring dst_r)

Function Documentation

idSubstPoly()

ideal idSubstPoly	(	ideal	id,
		int	n,
		poly	e )

Definition at line 425 of file maps_ip.cc.

{
 
#ifdef HAVE_PLURAL
  if (rIsPluralRing(currRing))
  {
    int k=MATROWS((matrix)id)*MATCOLS((matrix)id);
    ideal res=(ideal)mpNew(MATROWS((matrix)id),MATCOLS((matrix)id));
    res->rank = id->rank;
    for(k--;k>=0;k--)
    {
      res->m[k]=pSubst(pCopy(id->m[k]),n,e);
    }
    return res;
  }
#endif
#ifdef HAVE_SHIFTBBA
  if (rIsLPRing(currRing))
  {
    int k=MATROWS((matrix)id)*MATCOLS((matrix)id);
    ideal res=(ideal)mpNew(MATROWS((matrix)id),MATCOLS((matrix)id));
    res->rank = id->rank;
    for(k--;k>=0;k--)
    {
      res->m[k]=pSubst(pCopy(id->m[k]),n,e);
    }
    return res;
  }
#endif
  return id_SubstPoly(id,n,e,currRing,currRing,ndCopyMap);
}

maCopy()

map maCopy	(	map	theMap,
		const ring	dst_ring )

Definition at line 34 of file maps.cc.

{
  int i;
  map m=(map)idInit(IDELEMS(theMap),0);
  for (i=IDELEMS(theMap)-1; i>=0; i--)
      m->m[i] = p_Copy(theMap->m[i],r);
  m->preimage=omStrDup(theMap->preimage);
  return m;
}

maEval()

poly maEval	(	map	theMap,
		poly	p,
		ring	preimage_r,
		nMapFunc	nMap,
		ideal	s,
		const ring	dst_r )

Definition at line 117 of file maps.cc.

{
  poly result = NULL;
  int i;
 
//  for(i=1; i<=preimage_r->N; i++)
//  {
//    pTest(theMap->m[i-1]);
//  }
//  while (p!=NULL)
//  {
//    poly q=maEvalMonom(theMap,p,preimage_r,s);
//    result = pAdd(result,q);
//    pIter(p);
//  }
  if (p!=NULL)
  {
    sBucket_pt b=sBucketCreate(dst_r);
    int l;
 
    while(p!=NULL)
    {
      poly h=maEvalMonom(theMap,p,preimage_r,s, nMap, dst_r);
      l=pLength(h);
      sBucket_Add_p(b,h,l);
      pIter(p);
    }
    sBucketDestroyAdd(b,&result,&l);
 
    assume(dst_r != NULL);
    assume(dst_r->cf != NULL);
 
    if (nCoeff_is_algExt(dst_r->cf))
      result = p_MinPolyNormalize(result, dst_r);
  }
  return result;
}

maEvalVariable()

poly maEvalVariable	(	poly	p,
		int	v,
		int	pExp,
		ideal	s,
		const ring	dst_r )

Definition at line 48 of file maps.cc.

{
  if (pExp==1)
    return p_Copy(p,dst_r);
 
  poly res;
 
  if((s!=NULL)&&(pExp<MAX_MAP_DEG))
  {
    int j=2;
    poly p0=p;
    // find starting point
    if(MATELEM(s,v,1)==NULL)
    {
      MATELEM(s,v,1)=p_Copy(p/*theMap->m[v-1]*/,dst_r);
    }
    else
    {
      while((j<=pExp)&&(MATELEM(s,v,j)!=NULL))
      {
        j++;
      }
      p0=MATELEM(s,v,j-1);
    }
    // multiply
    for(;j<=pExp;j++)
    {
      p0=MATELEM(s,v,j)=pp_Mult_qq(p0, p,dst_r);
      p_Normalize(p0, dst_r);
    }
    res=p_Copy(p0/*MATELEM(s,v,pExp)*/,dst_r);
  }
  else //if ((p->next!=NULL)&&(p->next->next==NULL))
  {
    res=p_Power(p_Copy(p,dst_r),pExp,dst_r);
  }
  return res;
}

maFetchPermLP()

void maFetchPermLP	(	const ring	preimage_r,
		const ring	dst_r,
		int *	perm )

Definition at line 298 of file maps.cc.

{
  for (int i = 0; i < preimage_r->N + 1; i++) { perm[i] = 0; }
 
  int preimage_lV = preimage_r->isLPring;
  int r_lV = dst_r->isLPring;
 
  int preimage_ncgens = preimage_r->LPncGenCount;
  int r_ncges = dst_r->LPncGenCount;
 
  int preimage_vars = preimage_lV - preimage_ncgens;
  int r_vars = r_lV - r_ncges;
 
  // for each block
  for (int i = 0; i < si_min(preimage_r->N / preimage_lV, dst_r->N / r_lV); i++)
  {
    // align variables
    for (int j = 1; j <= si_min(preimage_vars, r_vars); j++)
    {
      perm[(i * preimage_lV) + j] = (i * r_lV) + j;
    }
 
    // align ncgens
    for (int j = 1; j <= si_min(preimage_ncgens, r_ncges); j++)
    {
      perm[(i * preimage_lV) + preimage_vars + j] = (i * r_lV) + r_vars + j;
    }
  }
}

maFindPerm()

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 )

Definition at line 155 of file maps.cc.

{
  int i,j;
  /* find corresponding vars */
  for (i=0; i<preim_n; i++)
  {
    for(j=0; j<n; j++)
    {
      if (strcmp(preim_names[i],names[j])==0)
      {
        if (BVERBOSE(V_IMAP))
          Print("// var %s: nr %d -> nr %d\n",preim_names[i],i+1,j+1);
        /* var i+1 from preimage ring is var j+1  (index j+1) from image ring */
        perm[i+1]=j+1;
        break;
      }
    }
    if ((perm[i+1]==0)&&(par!=NULL)
        // do not consider par of Fq
         && (ch!=n_GF))
    {
      for(j=0; j<nop; j++)
      {
        if (strcmp(preim_names[i],par[j])==0)
        {
          if (BVERBOSE(V_IMAP))
            Print("// var %s: nr %d -> par %d\n",preim_names[i],i+1,j+1);
          /* var i+1 from preimage ring is par j+1 (index j) from image ring */
          perm[i+1]=-(j+1);
        }
      }
    }
  }
  if (par_perm!=NULL)
  {
    for (i=0; i<preim_p; i++)
    {
      for(j=0; j<n; j++)
      {
        if (strcmp(preim_par[i],names[j])==0)
        {
          if (BVERBOSE(V_IMAP))
            Print("// par %s: par %d -> nr %d\n",preim_par[i],i+1,j+1);
          /*par i+1 from preimage ring is var j+1  (index j+1) from image ring*/
          par_perm[i]=j+1;
          break;
        }
      }
      if ((par!=NULL) && (par_perm[i]==0))
      {
        for(j=0; j<nop; j++)
        {
          if (strcmp(preim_par[i],par[j])==0)
          {
            if (BVERBOSE(V_IMAP))
              Print("// par %s: nr %d -> par %d\n",preim_par[i],i+1,j+1);
            /*par i+1 from preimage ring is par j+1 (index j) from image ring */
            par_perm[i]=-(j+1);
          }
        }
      }
    }
  }
}

maFindPermLP()

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 )

Definition at line 223 of file maps.cc.

{
  int i,j,b;
  /* find corresponding vars */
  for  (b=0;b<preim_n/lV;b++)
  {
    for (i=b*lV; i<(b+1)*lV; i++)
    {
      int cnt=0;
      for(j=0; j<n; j++)
      {
        if (strcmp(preim_names[i],names[j])==0)
        {
          if (cnt==b)
          {
            if (BVERBOSE(V_IMAP))
              Print("// var %s: nr %d -> nr %d\n",preim_names[i],i+1,j+1);
            /* var i+1 from preimage ring is var j+1  (index j+1) from image ring */
            perm[i+1]=j+1;
            break;
          }
          else cnt++;
        }
      }
      if ((perm[i+1]==0)&&(par!=NULL)
        // do not consider par of Fq
         && (ch!=n_GF))
      {
        for(j=0; j<nop; j++)
        {
          if (strcmp(preim_names[i],par[j])==0)
          {
            if (BVERBOSE(V_IMAP))
              Print("// var %s: nr %d -> par %d\n",preim_names[i],i+1,j+1);
            /* var i+1 from preimage ring is par j+1 (index j) from image ring */
            perm[i+1]=-(j+1);
          }
        }
      }
    }
  }
  if (par_perm!=NULL)
  {
    for (i=0; i<preim_p; i++)
    {
      for(j=0; j<n; j++)
      {
        if (strcmp(preim_par[i],names[j])==0)
        {
          if (BVERBOSE(V_IMAP))
            Print("// par %s: par %d -> nr %d\n",preim_par[i],i+1,j+1);
          /*par i+1 from preimage ring is var j+1  (index j+1) from image ring*/
          par_perm[i]=j+1;
          break;
        }
      }
      if ((par!=NULL) && (par_perm[i]==0))
      {
        for(j=0; j<nop; j++)
        {
          if (strcmp(preim_par[i],par[j])==0)
          {
            if (BVERBOSE(V_IMAP))
              Print("// par %s: nr %d -> par %d\n",preim_par[i],i+1,j+1);
            /*par i+1 from preimage ring is par j+1 (index j) from image ring */
            par_perm[i]=-(j+1);
          }
        }
      }
    }
  }
}

maIMap()

poly maIMap	(	ring	src_ring,
		ring	dst_ring,
		poly	p )

maMaxDeg_Ma()

int maMaxDeg_Ma	(	ideal	a,
		ring	preimage_r )

Definition at line 352 of file maps.cc.

{
  int i,j;
  int N = preimage_r->N;
  poly p;
  int *m=(int *)omAlloc0(N*sizeof(int));
 
  for (i=MATROWS(a)*MATCOLS(a)-1;i>=0;i--)
  {
    p=a->m[i];
    //pTest(p); // cannot test p because it is from another ring
    while(p!=NULL)
    {
      for(j=N-1;j>=0;j--)
      {
        m[j]=si_max(m[j],(int)p_GetExp( p,j+1,preimage_r));
        if (m[j]>=MAX_MAP_DEG)
        {
          i=MAX_MAP_DEG;
          goto max_deg_fertig_id;
        }
      }
      pIter(p);
    }
  }
  i=m[0];
  for(j=N-1;j>0;j--)
  {
    i=si_max(i,m[j]);
  }
max_deg_fertig_id:
  omFreeSize((ADDRESS)m,N*sizeof(int));
  return i;
}

maMaxDeg_P()

int maMaxDeg_P	(	poly	p,
		ring	preimage_r )

Definition at line 390 of file maps.cc.

{
  int i,j;
  int N = preimage_r->N;
  int *m=(int *)omAlloc0(N*sizeof(int));
 
//  pTest(p);
  while(p!=NULL)
  {
    for(j=N-1;j>=0;j--)
    {
      m[j]=si_max(m[j],(int)p_GetExp(p,j+1,preimage_r));
      if (m[j]>=MAX_MAP_DEG)
      {
        i=MAX_MAP_DEG;
        goto max_deg_fertig_p;
      }
    }
    pIter(p);
  }
  i=m[0];
  for(j=N-1;j>0;j--)
  {
    i=si_max(i,m[j]);
  }
max_deg_fertig_p:
  omFreeSize((ADDRESS)m,N*sizeof(int));
  return i;
}

p_MinPolyNormalize()

poly p_MinPolyNormalize	(	poly	p,
		const ring	r )

Definition at line 422 of file maps.cc.

{
  const coeffs C = r->cf;
  number one = n_Init(1, C);
  spolyrec rp;
 
  poly q = &rp;
 
  while (p != NULL)
  {
    // this returns 0, if p == MinPoly
    number product = n_Mult(p_GetCoeff(p, r), one, C);
    if ((product == NULL)||(n_IsZero(product, C)))
    {
      p_LmDelete(&p, r);
    }
    else
    {
      p_SetCoeff(p, product, r);
      pNext(q) = p;
      q = p;
      p = pNext(p);
    }
  }
  pNext(q) = NULL;
  n_Delete(&one, C);
  return rp.next;
}

pSubstPoly()

poly pSubstPoly	(	poly	p,
		int	var,
		poly	image )

Definition at line 403 of file maps_ip.cc.

{
  if (p==NULL) return NULL;
#ifdef HAVE_PLURAL
  if (rIsPluralRing(currRing))
  {
    return pSubst(pCopy(p),var,image);
  }
#endif
#ifdef HAVE_SHIFTBBA
  if (rIsLPRing(currRing))
  {
    return pSubst(pCopy(p),var,image);
  }
#endif
  return p_SubstPoly(p,var,image,currRing,currRing,ndCopyMap);
}