MCPcopy Create free account
hub / github.com/Singular/Singular / second_crit

Function second_crit

IntegerProgramming/binomial.cc:1322–1346  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1320
1321
1322BOOLEAN second_crit(const binomial& a, const binomial& b,
1323 const binomial& c)
1324// verifies if head(a) divides lcm(head(b),head(c))
1325{
1326
1327#ifdef SUPPORT_DRIVEN_METHODS
1328
1329 if((a.head_support & (b.head_support|c.head_support))!=a.head_support)
1330 return FALSE;
1331 // The above condition verifies if the support of head(a) is contained in
1332 // the support of lcm(head(b),head(c))
1333
1334#endif // SUPPORT_DRIVEN_METHODS.
1335
1336 for(short i=0;i<a._number_of_variables;i++)
1337 {
1338 Integer b_exponent=b.exponent_vector[i];
1339 Integer c_exponent=c.exponent_vector[i];
1340
1341 if(a.exponent_vector[i]>MAXIMUM(b_exponent,c_exponent))
1342 return FALSE;
1343 }
1344
1345 return (TRUE);
1346}
1347
1348
1349

Callers 1

unnecessary_S_pairMethod · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected