receive_generator()

bool gb2_comp::receive_generator ( gbvector * f, int n, const ring_elem denom )

virtual

Implements gb_node.

Definition at line 614 of file res-a2-gb.cpp.

{
  bool isgen = false;
  // It is our duty to free 'f'...
 
  for (int i = monideals.size(); i <= F->rank(); i++)
    {
      monideal_pair *p = new monideal_pair(originalR, mi_stash);
      monideals.push_back(p);
    }
 
  gbvector *fsyz = nullptr;
  if (orig_syz >= 0)
    {
      if (orig_syz > n)
        fsyz = GR->gbvector_term(
            Fsyz, denom, n + 1);  // Note the change in component number
      gb_reduce(f, fsyz);
      if (f == nullptr)
        {
          if (fsyz != nullptr && syz != nullptr)
            syz->receive_generator(fsyz, n_syz++, GR->one());
        }
      else
        {
          isgen = true;
          gb_insert(f, fsyz, 1);
        }
    }
  else
    {
      gb_reduce(f, fsyz);
      GR->gbvector_remove(fsyz);
      GR->gbvector_remove_content(f, nullptr);
      if (f != nullptr)
        {
          // schreyer_append(f);
          isgen = true;
          // gb_insert(f,Fsyz->e_sub_i(n_mingens),1);
          // The fsyz part will be set at the end of the degree,
          // after sorting takes place, and after auto-reduction in
          // this degree.
          gb_insert(f, nullptr, 1);
        }
    }
  return isgen;
}

References Fsyz, gb_insert(), gb_reduce(), GR, mi_stash, n_syz, orig_syz, originalR, p, and syz.