25 const int l = L->ncols-1;
27 for (
int j =
R->N;
j > 0;
j--) {
29 for (
k =
l;
k >= 0;
k--) {
54 for (
int j =
R->N;
j > 0;
j--) {
76 const unsigned long n_elems = L->ncols;
78 = (
unsigned int *)
omAlloc0((L->rank+1)*
sizeof(
unsigned int));
84 for (
int i = 0;
i <= L->rank;
i++) {
93 const poly a = L->m[
k-1];
109 const lt_struct *
const *
const hash_previous_module)
113 unsigned long count =
v[0].comp;
117 const poly q =
p_New(r);
121 for(
unsigned long i = 1;
i <
count;
i++) {
140 const ideal previous_module,
const std::vector<bool> &
variables,
141 const lt_struct *
const *
const hash_previous_module);
144 const ideal previous_module,
const std::vector<bool> &
variables,
145 const lt_struct *
const *
const hash_previous_module,
146 const bool use_cache);
152 const ideal previous_module,
const std::vector<bool> &
variables,
153 const lt_struct *
const *
const hash_previous_module,
154 const bool use_cache)
165 hash_previous_module);
168 hash_previous_module,
false);
178 const ideal previous_module,
const std::vector<bool> &
variables,
179 const lt_struct *
const *
const hash_previous_module,
180 const bool use_cache)
182 const poly tail = previous_module->m[
comp]->next;
189 hash_previous_module, use_cache);
223 for (
int i = 0;
i <
size;
i++) {
225 for (cache_term::iterator itr =
T->begin(); itr !=
T->end(); ++itr) {
227 p_Delete(
const_cast<poly*
>(&(itr->first)), r);
238 T->insert(cache_term::value_type(
p_Head(multiplier, r),
p_Copy(
p, r)));
242 const poly multiplier)
248 poly
p =
p_Copy(itr->second, r);
258 const ideal previous_module,
const std::vector<bool> &
variables,
259 const lt_struct *
const *
const hash_previous_module)
262 cache_term::const_iterator itr =
T->find(multiplier);
267 hash_previous_module,
true);
275 static poly
lift_ext_LT(
const poly a,
const ideal previous_module,
277 const lt_struct *
const *
const hash_previous_module,
278 const bool use_cache)
283 hash_previous_module, use_cache);
287 previous_module,
variables, hash_previous_module);
290 previous_module,
variables, hash_previous_module,
false);
308 for (
i =
k;
i >= 0;
i--) {
309 for (
j =
k;
j >
i;
j--) {
310 if (id->m[
j] !=
NULL) {
331 const poly f_i =
G->m[
i];
332 const poly f_j =
G->m[
j];
335 long exp_i, exp_j,
lcm;
336 for (
int k = (
int)r->N;
k > 0;
k--) {
354 const poly f_i =
G->m[
i];
355 const poly f_j =
G->m[
j];
358 poly head_ext =
p_Init(r);
361 long exp_i, exp_j,
lcm;
362 for (
int k = (
int)r->N;
k > 0;
k--) {
373 head->next = head_ext;
391 for (
int j =
i-1;
j >= 0;
j--) {
397 for (
int j =
i-1;
j >= 0;
j--) {
399 M_i->m[
k] = syzHead(
G,
i,
j);
426 for (
int j =
ncols-1;
j >= 0;
j--) {
441 for (
int i =
size-1;
i >= 0;
i--) {
449 for (
int i =
size-1;
i >= 0;
i--) {
465 return (comp_a > comp_b) - (comp_a < comp_b);
471 long deg_a =
p_Deg(p_a, r);
472 long deg_b =
p_Deg(p_b, r);
473 return (deg_a > deg_b) - (deg_a < deg_b);
484 for (
int i = r->N;
i > 0;
i--) {
485 cmp = (exp_a[
i] > exp_b[
i]) - (exp_a[
i] < exp_b[
i]);
495 poly p_a = *((poly *)a);
496 poly p_b = *((poly *)
b);
513 ideal *
M = (ideal *)
omalloc((
G->ncols-1)*
sizeof(ideal));
514 for (
int i =
G->ncols-2;
i >= 0;
i--) {
515 M[
i] = syzM_i(
G,
i+1, syzHead);
518 for (
int i =
G->ncols-2;
i >= 0;
i--) {
525 qsort(frame->m, frame->ncols,
sizeof(poly),
compare_Mi);
533 const std::vector<bool> &
variables,
const bool use_cache)
546 omfree(hash_previous_module[
i]);
548 omFree(hash_previous_module);
561 for (
int j =
R->N;
j > 0;
j--) {
578 if (p_iter !=
NULL) {
579 while (p_iter->next !=
NULL) {
606 const bool single_module,
const bool use_cache,
607 const bool use_tensor_trick, std::vector<bool> &
variables)
621 if (use_tensor_trick) {
625 if (
index >= max_index) {
break; }
638 const bool single_module,
const bool use_cache,
639 const bool use_tensor_trick)
648 if (use_tensor_trick) {
656 do_lifting, single_module, use_cache, use_tensor_trick,
664 bool *single_module_ptr,
const char *method)
666 if (strcmp(method,
"complete") == 0) {
668 *do_lifting_ptr =
true;
669 *single_module_ptr =
false;
671 else if (strcmp(method,
"frame") == 0) {
673 *do_lifting_ptr =
false;
674 *single_module_ptr =
false;
676 else if (strcmp(method,
"extended frame") == 0) {
678 *do_lifting_ptr =
false;
679 *single_module_ptr =
false;
681 else if (strcmp(method,
"single module") == 0) {
683 *do_lifting_ptr =
true;
684 *single_module_ptr =
true;
688 *do_lifting_ptr =
true;
689 *single_module_ptr =
false;
696 #define insert_first_term(r, p, q, R) \
701 if (q != NULL && p_LmCmp(p, q, R) != 1) { \
702 while (q->next != NULL && p_LmCmp(p, q->next, R) == -1) { \
717 const bool single_module)
749 const bool use_cache,
const bool use_tensor_trick)
753 if (strcmp(method,
"frame") != 0) {
761 set_options(&syzHead, &do_lifting, &single_module, method);
763 single_module, use_cache, use_tensor_trick);
764 if (new_length <
length) {
766 (new_length+1)*
sizeof(ideal));
768 if (strcmp(method,
"frame") != 0) {
772 result->length = new_length;
773 result->list_length = new_length;
static int si_max(const int a, const int b)
Class Cache is a template-implementation of a cache with arbitrary classes for representing keys and ...
static FORCE_INLINE number n_InpNeg(number n, const coeffs r)
in-place negation of n MUST BE USED: n = n_InpNeg(n) (no copy is returned)
static FORCE_INLINE number n_Div(number a, number b, const coeffs r)
return the quotient of 'a' and 'b', i.e., a/b; raises an error if 'b' is not invertible in r exceptio...
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
static FORCE_INLINE void n_InpMult(number &a, number b, const coeffs r)
multiplication of 'a' and 'b'; replacement of 'a' by the product a*b
static FORCE_INLINE BOOLEAN n_Equal(number a, number b, const coeffs r)
TRUE iff 'a' and 'b' represent the same number; they may have different representations.
const CanonicalForm int s
const Variable & v
< [in] a sqrfree bivariate poly
int comp(const CanonicalForm &A, const CanonicalForm &B)
compare polynomials
ideal id_Copy(ideal h1, const ring r)
copy an ideal
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
static BOOLEAN length(leftv result, leftv arg)
int lcm(unsigned long *l, unsigned long *a, unsigned long *b, unsigned long p, int dega, int degb)
#define p_SetCoeff0(p, n, r)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
#define __p_GetComp(p, r)
#define omFreeSize(addr, size)
#define omReallocSize(addr, o_size, size)
#define omFreeBin(addr, bin)
#define p_MemSum_LengthGeneral(r, s1, s2, length)
static int index(p_Length length, p_Ord ord)
unsigned long p_GetShortExpVector(const poly p, const ring r)
long p_Deg(poly a, const ring r)
static poly p_Add_q(poly p, poly q, const ring r)
static void p_MemAdd_NegWeightAdjust(poly p, const ring r)
static poly p_Head(poly p, const ring r)
static unsigned long p_SetExp(poly p, const unsigned long e, const unsigned long iBitmask, const int VarOffset)
set a single variable exponent @Note: VarOffset encodes the position in p->exp
static void p_ExpVectorDiff(poly pr, poly p1, poly p2, const ring r)
static unsigned long p_SetComp(poly p, unsigned long c, ring r)
static void p_Setm(poly p, const ring r)
static int p_LmCmp(poly p, poly q, const ring r)
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
static poly p_New(const ring, omBin bin)
static BOOLEAN p_DivisibleBy(poly a, poly b, const ring r)
static poly p_Mult_nn(poly p, number n, const ring r)
static void p_Delete(poly *p, const ring r)
static BOOLEAN _p_LmDivisibleByNoComp(poly a, poly b, const ring r)
return: FALSE, if there exists i, such that a->exp[i] > b->exp[i] TRUE, otherwise (1) Consider long v...
static unsigned pLength(poly a)
static void p_GetExpV(poly p, int *ev, const ring r)
static void p_LmFree(poly p, ring)
static poly p_Init(const ring r, omBin bin)
static poly p_Copy(poly p, const ring r)
returns a copy of p
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Compatiblity layer for legacy polynomial operations (over currRing)
#define pLmDelete(p)
assume p != NULL, deletes Lm(p)->coef and Lm(p)
void sBucket_Add_p(sBucket_pt bucket, poly p, int length)
adds poly p to bucket destroys p!
void sBucketDestroy(sBucket_pt *bucket)
sBucket_pt sBucketCreate(const ring r)
void sBucketClearAdd(sBucket_pt bucket, poly *p, int *length)
int status int void size_t count
ideal idInit(int idsize, int rank)
initialise an ideal / module
ideal id_Head(ideal h, const ring r)
returns the ideals of initial terms
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
bool operator()(const poly &l, const poly &r) const
static bool check_variables(const std::vector< bool > &variables, const poly m)
static int compare_deg(const poly p_a, const poly p_b)
static ideal syzM_i_sorted(const ideal G, const int i, syzHeadFunction *syzHead)
static void update_variables(std::vector< bool > &variables, const ideal L)
std::map< poly, poly, cache_compare > cache_term
static ideal computeFrame(const ideal G, syzM_i_Function syzM_i, syzHeadFunction *syzHead)
static int compare_comp(const poly p_a, const poly p_b)
static ideal idConcat(const ideal *M, const int size, const int rank)
static poly lift_ext_LT(const poly a, const ideal previous_module, const std::vector< bool > &variables, const lt_struct *const *const hash_previous_module, const bool use_cache)
static void initialize_hash(lt_struct **C, const ideal L)
static poly get_from_cache_term(const cache_term::const_iterator itr, const poly multiplier)
static poly syzHeadExtFrame(const ideal G, const int i, const int j)
static poly traverse_tail(const poly multiplier, const int comp, const ideal previous_module, const std::vector< bool > &variables, const lt_struct *const *const hash_previous_module)
static void computeLiftings(const resolvente res, const int index, const std::vector< bool > &variables, const bool use_cache)
static bool contains_unused_variable(const poly m, const std::vector< bool > &variables)
static int compare_lex(const poly p_a, const poly p_b)
ideal syzM_i_Function(ideal, int, syzHeadFunction)
static void set_options(syzHeadFunction **syzHead_ptr, bool *do_lifting_ptr, bool *single_module_ptr, const char *method)
static void initialize_cache(const int size)
static poly compute_image(const poly multiplier, const int comp, const ideal previous_module, const std::vector< bool > &variables, const lt_struct *const *const hash_previous_module, const bool use_cache)
#define insert_first_term(r, p, q, R)
static poly find_reducer(const poly multiplier, const poly t, const lt_struct *const *const hash_previous_module)
static void delete_tails(resolvente res, const int index)
static int computeResolution(resolvente res, const int max_index, syzHeadFunction *syzHead, const bool do_lifting, const bool single_module, const bool use_cache, const bool use_tensor_trick)
syStrategy syFrank(const ideal arg, const int length, const char *method, const bool use_cache, const bool use_tensor_trick)
static void insert_into_cache_term(cache_term *T, const poly multiplier, const poly p)
static cache_term * Cache
static void delete_cache(const int size)
static poly syzHeadFrame(const ideal G, const int i, const int j)
static void insert_ext_induced_LTs(const resolvente res, const int length, const bool single_module)
static poly reduce_term(const poly multiplier, const poly term, const ideal previous_module, const std::vector< bool > &variables, const lt_struct *const *const hash_previous_module, const bool use_cache)
static void id_DelDiv_no_test(ideal id)
static int computeResolution_iteration(resolvente res, const int max_index, syzHeadFunction *syzHead, const bool do_lifting, const bool single_module, const bool use_cache, const bool use_tensor_trick, std::vector< bool > &variables)
static ideal syzM_i_unsorted(const ideal G, const int i, syzHeadFunction *syzHead)
static int compare_Mi(const void *a, const void *b)
static void delete_variables(resolvente res, const int index, const std::vector< bool > &variables)
poly syzHeadFunction(ideal, int, int)