hilb.h File Reference

#include "polys/monomials/ring.h"
#include "kernel/polys.h"
#include "misc/intvec.h"
#include "coeffs/bigintmat.h"

Go to the source code of this file.

Functions
intvec *	hFirstSeries (ideal S, intvec *modulweight, ideal Q=NULL, intvec *wdegree=NULL)
intvec *	hFirstSeries1 (ideal S, intvec *modulweight, ideal Q=NULL, intvec *wdegree=NULL)
intvec *	hFirstSeries0 (ideal S, ideal Q, intvec *wdegree, const ring src, const ring Qt)
poly	hFirstSeries0p (ideal A, ideal Q, intvec *wdegree, const ring src, const ring Qt)
bigintmat *	hPoly2BIV (poly h, const ring Qt, const coeffs biv_cf)
poly	hBIV2Poly (bigintmat *b, const ring Qt, const coeffs biv_cf)
bigintmat *	hFirstSeries0b (ideal I, ideal Q, intvec *wdegree, intvec *shifts, const ring src, const coeffs biv_cf)
bigintmat *	hSecondSeries0b (ideal I, ideal Q, intvec *wdegree, intvec *shifts, const ring src, const coeffs biv_cf)
poly	hFirstSeries0m (ideal A, ideal Q, intvec *wdegree, intvec *shifts, const ring src, const ring Qt)
intvec *	hSecondSeries (intvec *hseries1)
void	hLookSeries (ideal S, intvec *modulweight, ideal Q=NULL, intvec *wdegree=NULL)

Function Documentation

hBIV2Poly()

poly hBIV2Poly	(	bigintmat *	b,
		const ring	Qt,
		const coeffs	biv_cf
	)

Definition at line 2005 of file hilb.cc.

{
  poly p=NULL;
  nMapFunc f=n_SetMap(biv_cf,Qt->cf);
  for(int d=0;d<b->rows()-1;d++)
  {
    poly h=p_New(Qt);
    p_SetExp(h,1,d,Qt);p_Setm(h,Qt);
    pSetCoeff0(h,f(BIMATELEM(*b,1,d+1),biv_cf,Qt->cf));
    p=p_Add_q(p,h,Qt);
  }
  return p;
}

hFirstSeries()

intvec * hFirstSeries	(	ideal	S,
		intvec *	modulweight,
		ideal	Q = NULL,
		intvec *	wdegree = NULL
	)

Definition at line 1514 of file hilb.cc.

{
  intvec* res;
  #if 0
  // find degree bound
  int a,b,prod;
  a=rVar(currRing);
  b=1;
  prod=a;
  while(prod<(1<<15) && (a>1))
  {
    a--;b++;
    prod*=a;
    prod/=b;
  }
  if (a==1) b=(1<<15);
  // check degree bound
  BOOLEAN large_deg=FALSE;
  int max=0;
  for(int i=IDELEMS(A)-1;i>=0;i--)
  {
    if (A->m[i]!=NULL)
    {
      int mm=p_Totaldegree(A->m[i],currRing);
      if (mm>max)
      {
        max=mm;
        if (max>=b)
        {
          large_deg=TRUE;
          break;
        }
      }
    }
  }
  if (!large_deg)
  {
    void (*WerrorS_save)(const char *s) = WerrorS_callback;
    WerrorS_callback=WerrorS_dummy;
    res=hFirstSeries1(A,module_w,Q,wdegree);
    WerrorS_callback=WerrorS_save;
    if (errorreported==0)
    {
      return res;
    }
    else errorreported=0;// retry with other alg.:
  }
  #endif
 
  if (hilb_Qt==NULL) hilb_Qt=makeQt();
  if (!id_IsModule(A,currRing))
    return hFirstSeries0(A,Q,wdegree,currRing,hilb_Qt);
  res=NULL;
  int w_max=0,w_min=0;
  if (module_w!=NULL)
  {
    w_max=module_w->max_in();
    w_min=module_w->min_in();
  }
  for(int c=1;c<=A->rank;c++)
  {
    ideal Ac=getModuleComp(A,c,currRing);
    intvec *res_c=hFirstSeries0(Ac,Q,wdegree,currRing,hilb_Qt);
    id_Delete(&Ac,currRing);
    intvec *tmp=NULL;
    if (res==NULL)
      res=new intvec(res_c->length()+(w_max-w_min));
    if ((module_w==NULL) || ((*module_w)[c-1]==0)) tmp=ivAdd(res,res_c);
    else tmp=ivAddShift(res, res_c,(*module_w)[c-1]-w_min);
    delete res_c;
    if (tmp!=NULL)
    {
      delete res;
      res=tmp;
    }
  }
  (*res)[res->length()-1]=w_min;
  return res;
}

hFirstSeries0()

intvec * hFirstSeries0	(	ideal	S,
		ideal	Q,
		intvec *	wdegree,
		const ring	src,
		const ring	Qt
	)

Definition at line 1478 of file hilb.cc.

{
  poly s=hFirstSeries0p(A,Q,wdegree,src,Qt);
  intvec *ss;
  if (s==NULL)
    ss=new intvec(2);
  else
  {
    ss=new intvec(p_Totaldegree(s,Qt)+2);
    while(s!=NULL)
    {
      int i=p_Totaldegree(s,Qt);
      long l=n_Int(pGetCoeff(s),Qt->cf);
      (*ss)[i]=n_Int(pGetCoeff(s),Qt->cf);
      if((l==0)||(l<=-INT_MAX)||(l>INT_MAX))
      {
        if(!errorreported) Werror("overflow in hilb at t^%d\n",i);
      }
      else (*ss)[i]=(int)l;
      p_LmDelete(&s,Qt);
    }
  }
  return ss;
}

hFirstSeries0b()

bigintmat * hFirstSeries0b	(	ideal	I,
		ideal	Q,
		intvec *	wdegree,
		intvec *	shifts,
		const ring	src,
		const coeffs	biv_cf
	)

Definition at line 2019 of file hilb.cc.

{
  if (hilb_Qt==NULL) hilb_Qt=makeQt();
  poly h;
  int m=0;
  if (id_IsModule(I,src))
  {
    h=hFirstSeries0m(I,Q,wdegree,shifts,src,hilb_Qt);
    if (shifts!=NULL) m=shifts->min_in();
  }
  else
    h=hFirstSeries0p(I,Q,wdegree,src,hilb_Qt);
  bigintmat *biv=hPoly2BIV(h,hilb_Qt,biv_cf);
  if (m!=0)
  {
    n_Delete(&BIMATELEM(*biv,1,biv->cols()),biv_cf);
    BIMATELEM(*biv,1,biv->cols())=n_Init(m,biv_cf);
  }
  p_Delete(&h,hilb_Qt);
  return biv;
}

hFirstSeries0m()

poly hFirstSeries0m	(	ideal	A,
		ideal	Q,
		intvec *	wdegree,
		intvec *	shifts,
		const ring	src,
		const ring	Qt
	)

Definition at line 1427 of file hilb.cc.

{
  int rk=A->rank;
  poly h=NULL;
  for(int i=1;i<=rk;i++)
  {
    ideal AA=id_Head(A,src);
    BOOLEAN have_terms=FALSE;
    for(int ii=0;ii<IDELEMS(AA);ii++)
    {
      if (AA->m[ii]!=NULL)
      {
        if(p_GetComp(AA->m[ii],src)!=i)
          p_Delete(&AA->m[ii],src);
        else
        {
          p_SetComp(AA->m[ii],0,src);
          p_Setm(AA->m[ii],src);
          have_terms=TRUE;
        }
      }
    }
    poly h_i=NULL;
    //int sh=0;
    if (have_terms)
    {
      idSkipZeroes(AA);
      h_i=hFirstSeries0p(AA,Q,wdegree,src,Qt);
    }
    else
    {
      h_i=p_One(Qt);
    }
    id_Delete(&AA,src);
    poly s=p_One(Qt);
    if (shifts!=NULL)
    {
      int m=shifts->min_in();
      int sh=(*shifts)[i-1]-m;
      if (sh!=0)
      {
        p_SetExp(s,1,sh,Qt);
        p_Setm(s,Qt);
      }
    }
    h_i=p_Mult_q(h_i,s,Qt);
    h=p_Add_q(h,h_i,Qt);
  }
  return h;
}

hFirstSeries0p()

poly hFirstSeries0p	(	ideal	A,
		ideal	Q,
		intvec *	wdegree,
		const ring	src,
		const ring	Qt
	)

Definition at line 1384 of file hilb.cc.

{
  A=id_Head(A,src);
  id_Test(A,src);
  ideal AA;
  if (Q!=NULL)
  {
    ideal QQ=id_Head(Q,src);
    AA=id_SimpleAdd(A,QQ,src);
    id_Delete(&QQ,src);
    id_Delete(&A,src);
    idSkipZeroes(AA);
    int c=p_GetComp(AA->m[0],src);
    if (c!=0)
    {
      for(int i=0;i<IDELEMS(AA);i++)
        if (AA->m[i]!=NULL) p_SetComp(AA->m[i],c,src);
    }
  }
  else AA=A;
  id_DelDiv(AA,src);
  IDELEMS(AA)=idSkipZeroes0(AA);
   /* sort */
  if (IDELEMS(AA)>1)
  #ifdef HAVE_QSORT_R
    #if defined(__APPLE__) || defined(__FreeBSD__) || defined(__OpenBSD__) || defined(__NetBSD__) || defined(__CYGWIN__)
      qsort_r(AA->m,IDELEMS(AA),sizeof(poly),src,compare_rp);
    #else
      qsort_r(AA->m,IDELEMS(AA),sizeof(poly),compare_rp,src);
    #endif
  #else
  {
    ring r=currRing;
    currRing=src;
    qsort(AA->m,IDELEMS(AA),sizeof(poly),compare_rp_currRing);
    currRing=r;
  }
  #endif
  poly s=hilbert_series(AA,src,wdegree,Qt);
  id_Delete0(&AA,src);
  return s;
}

hFirstSeries1()

intvec * hFirstSeries1	(	ideal	S,
		intvec *	modulweight,
		ideal	Q = NULL,
		intvec *	wdegree = NULL
	)

Definition at line 1974 of file hilb.cc.

{
  id_LmTest(S, currRing);
  if (Q!= NULL) id_LmTest(Q, currRing);
 
  intvec *hseries1= hSeries(S, modulweight,wdegree, Q);
  if (errorreported) { delete hseries1; hseries1=NULL; }
  return hseries1;
}

hLookSeries()

void hLookSeries	(	ideal	S,
		intvec *	modulweight,
		ideal	Q = NULL,
		intvec *	wdegree = NULL
	)

Definition at line 220 of file hilb.cc.

{
  id_LmTest(S, currRing);
 
  if (!id_IsModule(S,currRing))
  {
    if (hilb_Qt==NULL) hilb_Qt=makeQt();
    poly hseries=hFirstSeries0p(S,Q,wdegree,currRing,hilb_Qt);
 
    hPrintHilb(hseries,hilb_Qt,wdegree);
    p_Delete(&hseries,hilb_Qt);
  }
  else
  {
    if (hilb_Qt==NULL) hilb_Qt=makeQt();
    poly hseries=hFirstSeries0m(S,Q,wdegree,modulweight,currRing,hilb_Qt);
    if ((modulweight!=NULL)&&(modulweight->compare(0)!=0))
    {
      char *s=modulweight->ivString(1,0,1);
      Print("module weights:%s\n",s);
      omFree(s);
    }
    hPrintHilb(hseries,hilb_Qt,wdegree);
    p_Delete(&hseries,hilb_Qt);
  }
}

hPoly2BIV()

bigintmat * hPoly2BIV	(	poly	h,
		const ring	Qt,
		const coeffs	biv_cf
	)

Definition at line 1984 of file hilb.cc.

{
  int td=0;
  nMapFunc f;
  if (h!=NULL)
  {
    td=p_Totaldegree(h,Qt);
    h=p_Copy(h,Qt);
    f=n_SetMap(Qt->cf,biv_cf);
  }
  bigintmat* biv=new bigintmat(1,td+2,biv_cf);
  while(h!=NULL)
  {
    int d=p_Totaldegree(h,Qt);
    n_Delete(&BIMATELEM(*biv,1,d+1),biv_cf);
    BIMATELEM(*biv,1,d+1)=f(pGetCoeff(h),Qt->cf,biv_cf);
    p_LmDelete(&h,Qt);
  }
  return biv;
}

hSecondSeries()

intvec * hSecondSeries

(

intvec *

hseries1

)

Definition at line 71 of file hilb.cc.

{
  intvec *work, *hseries2;
  int i, j, k, t, l;
  int s;
  if (hseries1 == NULL)
    return NULL;
  work = new intvec(hseries1);
  k = l = work->length()-1;
  s = 0;
  for (i = k-1; i >= 0; i--)
    s += (*work)[i];
  loop
  {
    if ((s != 0) || (k == 1))
      break;
    s = 0;
    t = (*work)[k-1];
    k--;
    for (i = k-1; i >= 0; i--)
    {
      j = (*work)[i];
      (*work)[i] = -t;
      s += t;
      t += j;
    }
  }
  hseries2 = new intvec(k+1);
  for (i = k-1; i >= 0; i--)
    (*hseries2)[i] = (*work)[i];
  (*hseries2)[k] = (*work)[l];
  delete work;
  return hseries2;
}

hSecondSeries0b()

bigintmat * hSecondSeries0b	(	ideal	I,
		ideal	Q,
		intvec *	wdegree,
		intvec *	shifts,
		const ring	src,
		const coeffs	biv_cf
	)

Definition at line 2041 of file hilb.cc.

{
  if (hilb_Qt==NULL) hilb_Qt=makeQt();
  poly h;
  if (id_IsModule(I,src))
    h=hFirstSeries0m(I,Q,wdegree,shifts,src,hilb_Qt);
  else
    h=hFirstSeries0p(I,Q,wdegree,src,hilb_Qt);
  int co;
  poly h2=hFirst2Second(h,hilb_Qt,co);
  p_Delete(&h,hilb_Qt);
  bigintmat *biv=hPoly2BIV(h2,hilb_Qt,biv_cf);
  p_Delete(&h2,hilb_Qt);
  return biv;
}