Macaulay2 Engine
Loading...
Searching...
No Matches

◆ reduce()

bool binomialGB::reduce ( binomial & f) const

Definition at line 884 of file gb-toric.cpp.

885{
886 while (true)
887 {
888 binomial_gb_elem *p = find_divisor(f.lead);
889 if (p == nullptr)
890 {
892 return R->normalize(f);
893 }
894 else
895 {
896 // Do the division:
897 if (!R->one_reduction_step(f, p->f)) // Modifies 'f'.
898 return false;
899 }
900 }
901}
void reduce_monomial(monomial0 m) const
Definition gb-toric.cpp:877
monomial_list * find_divisor(monomial_list *I, monomial0 m) const
Definition gb-toric.cpp:720
const binomial_ring * R
Definition gb-toric.hpp:252
int p
monomial0 tail
Definition gb-toric.hpp:52
monomial0 lead
Definition gb-toric.hpp:51

References find_divisor(), binomial::lead, p, R, reduce_monomial(), and binomial::tail.