![]() |
My Project
debian-1:4.1.1-p2+ds-4build4
|
New implementations for the computation of syzygies and resolutions. More...
#include "kernel/mod2.h"
#include <string.h>
#include "syzextra.h"
#include "omalloc/omalloc.h"
#include "misc/intvec.h"
#include "misc/options.h"
#include "coeffs/coeffs.h"
#include "polys/monomials/p_polys.h"
#include "polys/monomials/ring.h"
#include "polys/simpleideals.h"
#include "polys/kbuckets.h"
#include "polys/sbuckets.h"
#include "polys/operations/p_Mult_q.h"
#include "kernel/GBEngine/kstd1.h"
#include "kernel/polys.h"
#include "kernel/GBEngine/syz.h"
#include "kernel/ideals.h"
#include "kernel/oswrapper/timer.h"
#include "Singular/tok.h"
#include "Singular/ipid.h"
#include "Singular/lists.h"
#include "Singular/attrib.h"
#include "Singular/ipshell.h"
#include <stdio.h>
#include <stdlib.h>
Go to the source code of this file.
Data Structures | |
class | SBucketWrapper |
class | CDivisorEnumerator |
TODO: More... | |
class | CDivisorEnumerator2 |
TODO: More... | |
Macros | |
#define | _GNU_SOURCE /*for qsort_r on cygwin, must be before system includes*/ |
#define | RTIMER_BENCHMARKING 0 |
#define | qsort_my(m, s, ss, r, cmp) qsort(m, s, ss, cmp) |
Functions | |
static FORCE_INLINE poly | pp_Add_qq (const poly a, const poly b, const ring R) |
static FORCE_INLINE poly | p_VectorProductLT (poly s, const ideal &L, const ideal &T, const ring &R) |
static FORCE_INLINE int | atGetInt (idhdl rootRingHdl, const char *attribute, long def) |
static int | cmp_c_ds (const void *p1, const void *p2) |
static FORCE_INLINE poly | myp_Head (const poly p, const bool bIgnoreCoeff, const ring r) |
poly | leadmonom (const poly p, const ring r, const bool bSetZeroComp) |
return a new term: leading coeff * leading monomial of p with 0 leading component! More... | |
poly | p_Tail (const poly p, const ring r) |
return the tail of a given polynomial or vector returns NULL if input is NULL, otherwise the result is a new polynomial/vector in the ring r More... | |
ideal | id_Tail (const ideal id, const ring r) |
return the tail of a given ideal or module returns NULL if input is NULL, otherwise the result is a new ideal/module in the ring r NOTE: the resulting rank is autocorrected More... | |
void | Sort_c_ds (const ideal id, const ring r) |
inplace sorting of the module (ideal) id wrt <_(c,ds) More... | |
bool | my_p_LmCmp (poly a, poly b, const ring r) |
static BOOLEAN | _p_LmDivisibleByNoComp (const poly a, const poly b, const poly c, const ring r) |
_p_LmDivisibleByNoComp for a | b*c More... | |
New implementations for the computation of syzygies and resolutions.
ABSTRACT: Computation of Syzygies due to Schreyer
Definition in file syzextra.cc.
Definition at line 18 of file syzextra.cc.
#define RTIMER_BENCHMARKING 0 |
Definition at line 61 of file syzextra.cc.
|
inlinestatic |
_p_LmDivisibleByNoComp for a | b*c
Definition at line 1516 of file syzextra.cc.
|
static |
Definition at line 158 of file syzextra.cc.
Definition at line 168 of file syzextra.cc.
return the tail of a given ideal or module returns NULL if input is NULL, otherwise the result is a new ideal/module in the ring r NOTE: the resulting rank is autocorrected
Definition at line 325 of file syzextra.cc.
return a new term: leading coeff * leading monomial of p with 0 leading component!
Definition at line 288 of file syzextra.cc.
bool my_p_LmCmp | ( | poly | a, |
poly | b, | ||
const ring | r | ||
) |
Definition at line 1140 of file syzextra.cc.
|
static |
Definition at line 271 of file syzextra.cc.
return the tail of a given polynomial or vector returns NULL if input is NULL, otherwise the result is a new polynomial/vector in the ring r
Definition at line 316 of file syzextra.cc.
|
static |
Definition at line 128 of file syzextra.cc.
|
static |
inplace sorting of the module (ideal) id wrt <_(c,ds)
Definition at line 342 of file syzextra.cc.