221{
224 {
225 return false;
226 }
227
228
230 {
231
232 return false;
233 }
234
238 {
239 return false;
240 }
241
242 int i = pair.i;
243 int j = pair.j;
244
246 IntermediateBasis::const_iterator
end = F.end();
247 for (IntermediateBasis::const_iterator it = F.begin(); it !=
end; ++it)
248 {
249 int k = it->first;
250 const BRP *K = &(it->second);
251
254 {
255 return false;
256 }
257 }
258
259
260 return true;
261}
static bool isDivisibleBy(const brMonomial &a, const brMonomial &b)
static bool isRelativelyPrime(const brMonomial &a, const brMonomial &b)
unsigned int size() const
Boolean (F_2-coefficient) polynomial stored as an ordered list of square-free monomials.
Materialised (f, g) pair of BRP polynomials referenced by a Pair index record.
bool inList(int i, int j, const Pairs &B, const IntermediateBasis &F)
TermIterator< Nterm > end(Nterm *)