countmon.hpp

Go to the documentation of this file.

#ifndef ALREADY_countmon
#define ALREADY_countmon

#include<list>

QQ binomial(int m,int n)
{
  QQ res=1;
  if(n>m || m<0 || n<0)
    return 0;
  for(int i=m;i>m-n;i--)
    res*=i;
  for(int i=1;i<=n;i++)
    res/=(QQ)i;
  return res;
}

template<typename mon>
QQ countmon(mon * ideal, int d, int nbvar,int nbmon)
{
  QQ res=binomial(nbvar+d-1,d), sign=1;
  std::list<mon> ppcm,stock;
  for(int i=0;i<nbmon;i++)
    stock.push_back(ideal[i]);
  for (typename std::list<mon>::iterator iterstock=stock.begin();
       iterstock!=stock.end();iterstock++)
    for(typename std::list<mon>::iterator iter2=stock.begin();
    iter2!=stock.end();iter2++)
      if (isdivisible<mon>(*iterstock,*iter2,nbvar) 
          && !(iterstock==iter2))
    stock.erase(iter2--);      

  for(typename std::list<mon>::iterator iter=stock.begin()
    ;iter!=stock.end();iter++)
    res-=binomial(nbvar+d-iter->GetDegree()-1,d-iter->GetDegree());

  for(int i=0;i<nbvar && stock.size()>1;i++)//on fait ca sur tout le complexe de kozul
    {
      //cout<<"res ici "<<res<<endl;
       for(typename std::list<mon>::iterator iter1=stock.begin();
      iter1!=stock.end();iter1++)
    for(typename std::list<mon>::iterator iter2=(++iter1)--;
        iter2!=stock.end();iter2++)
      {
        ppcm.push_back(lcm(*iter1,*iter2));
        //cout<<"ppcm.back "<<ppcm.back()<<endl;
      }
      stock=ppcm;
      //filtrer pour ne garder que les minimaux pour la division.
      for (typename std::list<mon>::iterator iterstock=stock.begin();
       iterstock!=stock.end();iterstock++)
    for(typename std::list<mon>::iterator iter2=stock.begin();
        iter2!=stock.end();iter2++)
      if (isdivisible<mon>(*iterstock,*iter2,nbvar) 
          && !(iterstock==iter2))
        stock.erase(iter2--);      
      //mettre a jour res avec ceux la.
      for(typename std::list<mon>::iterator iterstock=stock.begin();
      iterstock!=stock.end();iterstock++)
    res+=sign*binomial(nbvar+d-iterstock->GetDegree()-1
               ,d-iterstock->GetDegree());
      sign*=-1;
      ppcm.erase(ppcm.begin(),ppcm.end());
    }
  return res;
}

template<typename Base>
QQ Bindeg(const Base &b,int d)
{
  QQ res=0;
  for(typename Base::const_iterator iter=b.begin();iter!=b.end();iter++)
    {
      int count=0;
      mon *tmp=(mon*)MAC_REV_MALLOC<mon>(
                      (iter->taille1+iter->taille2)*sizeof(mon));
      res+=countmon(iter->refuse,d,b.nbvar(),iter->taille2);
      //res-=countmon(iter->accept,d,b.nbvar(),iter->taille1);
      for(int i=0;i<iter->taille1;i++)
    tmp[count++]=iter->accept[i];
      for(int i=0;i<iter->taille2;i++)
    {
      tmp[count++]=iter->refuse[i];
    }
      res-=countmon(tmp,d,b.nbvar(),count);
      MAC_REV_FREE<mon>(tmp,(iter->taille1+iter->taille2)*sizeof(mon));
    }
  if (res<0) {cout<<"merde "<<res<<endl;exit(-1);};
  return res;
}

template<typename Base>
int critere(const Base &b,int d)
{
  cout<<"Binddeg "<<d<<" "<<Bindeg(b,d)<<endl;
  for(int i=0;i<b.nbvar();i++)
    {
      QQ tmp=0;
      int j;
      QQ sign=1;
      for(j=0;j<=i;j++)
    {
      tmp+=sign*binomial(i,j)*Bindeg(b,d-j);
      sign*=-1;
    }
      if (tmp<0) {cout<<"exitcrit"<<endl;return -1;}
      if (tmp==0) {cout<<"exitcrite"<<endl;return j-1;}
    }
  cout<<"exitcrit"<<endl;
  return -1;
}

#endif //ALREADY_countmon