![]() |
My Project
UNKNOWN_GIT_VERSION
|
#include "misc/auxiliary.h"
#include "omalloc/omalloc.h"
#include "misc/options.h"
#include "misc/intvec.h"
#include "matpol.h"
#include "monomials/p_polys.h"
#include "weight.h"
#include "sbuckets.h"
#include "clapsing.h"
#include "simpleideals.h"
Go to the source code of this file.
Functions | |
ideal | idInit (int idsize, int rank) |
initialise an ideal / module More... | |
void | idShow (const ideal id, const ring lmRing, const ring tailRing, const int debugPrint) |
int | id_PosConstant (ideal id, const ring r) |
index of generator with leading term in ground ring (if any); otherwise -1 More... | |
ideal | id_MaxIdeal (const ring r) |
initialise the maximal ideal (at 0) More... | |
void | id_Delete (ideal *h, ring r) |
deletes an ideal/module/matrix More... | |
void | id_ShallowDelete (ideal *h, ring r) |
Shallowdeletes an ideal/matrix. More... | |
void | idSkipZeroes (ideal ide) |
gives an ideal/module the minimal possible size More... | |
int | idElem (const ideal F) |
count non-zero elements More... | |
ideal | id_CopyFirstK (const ideal ide, const int k, const ring r) |
copies the first k (>= 1) entries of the given ideal/module and returns these as a new ideal/module (Note that the copied entries may be zero.) More... | |
void | id_Norm (ideal id, const ring r) |
ideal id = (id[i]), result is leadcoeff(id[i]) = 1 More... | |
void | id_DelMultiples (ideal id, const ring r) |
ideal id = (id[i]), c any unit if id[i] = c*id[j] then id[j] is deleted for j > i More... | |
void | id_DelEquals (ideal id, const ring r) |
ideal id = (id[i]) if id[i] = id[j] then id[j] is deleted for j > i More... | |
void | id_DelLmEquals (ideal id, const ring r) |
Delete id[j], if Lm(j) == Lm(i) and both LC(j), LC(i) are units and j > i. More... | |
void | id_DelDiv (ideal id, const ring r) |
delete id[j], if LT(j) == coeff*mon*LT(i) and vice versa, i.e., delete id[i], if LT(i) == coeff*mon*LT(j) More... | |
BOOLEAN | id_IsConstant (ideal id, const ring r) |
test if the ideal has only constant polynomials NOTE: zero ideal/module is also constant More... | |
ideal | id_Copy (ideal h1, const ring r) |
copy an ideal More... | |
void | id_DBTest (ideal h1, int level, const char *f, const int l, const ring r, const ring tailRing) |
Internal verification for ideals/modules and dense matrices! More... | |
static int | p_Comp_RevLex (poly a, poly b, BOOLEAN nolex, const ring R) |
for idSort: compare a and b revlex inclusive module comp. More... | |
intvec * | id_Sort (const ideal id, const BOOLEAN nolex, const ring r) |
sorts the ideal w.r.t. the actual ringordering uses lex-ordering when nolex = FALSE More... | |
ideal | id_SimpleAdd (ideal h1, ideal h2, const ring R) |
concat the lists h1 and h2 without zeros More... | |
BOOLEAN | idInsertPoly (ideal h1, poly h2) |
insert h2 into h1 (if h2 is not the zero polynomial) return TRUE iff h2 was indeed inserted More... | |
BOOLEAN | idInsertPolyOnPos (ideal I, poly p, int pos) |
insert p into I on position pos More... | |
BOOLEAN | id_InsertPolyWithTests (ideal h1, const int validEntries, const poly h2, const bool zeroOk, const bool duplicateOk, const ring r) |
insert h2 into h1 depending on the two boolean parameters: More... | |
ideal | id_Add (ideal h1, ideal h2, const ring r) |
h1 + h2 More... | |
ideal | id_Mult (ideal h1, ideal h2, const ring R) |
h1 * h2 one h_i must be an ideal (with at least one column) the other h_i may be a module (with no columns at all) More... | |
BOOLEAN | idIs0 (ideal h) |
returns true if h is the zero ideal More... | |
long | id_RankFreeModule (ideal s, ring lmRing, ring tailRing) |
return the maximal component number found in any polynomial in s More... | |
BOOLEAN | id_HomIdeal (ideal id, ideal Q, const ring r) |
void | idInitChoise (int r, int beg, int end, BOOLEAN *endch, int *choise) |
void | idGetNextChoise (int r, int end, BOOLEAN *endch, int *choise) |
int | idGetNumberOfChoise (int t, int d, int begin, int end, int *choise) |
int | binom (int n, int r) |
ideal | id_FreeModule (int i, const ring r) |
the free module of rank i More... | |
static void | makemonoms (int vars, int actvar, int deg, int monomdeg, const ring r) |
ideal | id_MaxIdeal (int deg, const ring r) |
static void | id_NextPotence (ideal given, ideal result, int begin, int end, int deg, int restdeg, poly ap, const ring r) |
ideal | id_Power (ideal given, int exp, const ring r) |
void | id_Compactify (ideal id, const ring r) |
ideal | id_Head (ideal h, const ring r) |
returns the ideals of initial terms More... | |
ideal | id_Homogen (ideal h, int varnum, const ring r) |
ideal | id_Vec2Ideal (poly vec, const ring R) |
poly | id_Array2Vector (poly *m, unsigned n, const ring R) |
for julia: convert an array of poly to vector More... | |
ideal | id_Matrix2Module (matrix mat, const ring R) |
converts mat to module, destroys mat More... | |
matrix | id_Module2Matrix (ideal mod, const ring R) |
matrix | id_Module2formatedMatrix (ideal mod, int rows, int cols, const ring R) |
ideal | id_ResizeModule (ideal mod, int rows, int cols, const ring R) |
ideal | id_Subst (ideal id, int n, poly e, const ring r) |
BOOLEAN | id_HomModule (ideal m, ideal Q, intvec **w, const ring R) |
ideal | id_Jet (const ideal i, int d, const ring R) |
ideal | id_JetW (const ideal i, int d, intvec *iv, const ring R) |
int | id_ReadOutPivot (ideal arg, int *comp, const ring r) |
intvec * | id_QHomWeight (ideal id, const ring r) |
BOOLEAN | id_IsZeroDim (ideal I, const ring r) |
void | id_Normalize (ideal I, const ring r) |
normialize all polys in id More... | |
int | id_MinDegW (ideal M, intvec *w, const ring r) |
ideal | id_Transp (ideal a, const ring rRing) |
transpose a module More... | |
ideal | id_TensorModuleMult (const int m, const ideal M, const ring rRing) |
ideal | id_ChineseRemainder (ideal *xx, number *q, int rl, const ring r) |
void | id_Shift (ideal M, int s, const ring r) |
ideal | id_Delete_Pos (const ideal I, const int p, const ring r) |
Variables | |
omBin | sip_sideal_bin = omGetSpecBin(sizeof(sip_sideal)) |
static poly * | idpower |
static int | idpowerpoint |
int binom | ( | int | n, |
int | r | ||
) |
Definition at line 912 of file simpleideals.cc.
ideal id_Add | ( | ideal | h1, |
ideal | h2, | ||
const ring | r | ||
) |
poly id_Array2Vector | ( | poly * | m, |
unsigned | n, | ||
const ring | R | ||
) |
ideal id_ChineseRemainder | ( | ideal * | xx, |
number * | q, | ||
int | rl, | ||
const ring | r | ||
) |
Definition at line 1796 of file simpleideals.cc.
void id_Compactify | ( | ideal | id, |
const ring | r | ||
) |
Definition at line 1086 of file simpleideals.cc.
ideal id_Copy | ( | ideal | h1, |
const ring | r | ||
) |
copies the first k (>= 1) entries of the given ideal/module and returns these as a new ideal/module (Note that the copied entries may be zero.)
Definition at line 225 of file simpleideals.cc.
void id_DBTest | ( | ideal | h1, |
int | level, | ||
const char * | f, | ||
const int | l, | ||
const ring | r, | ||
const ring | tailRing | ||
) |
Internal verification for ideals/modules and dense matrices!
Definition at line 415 of file simpleideals.cc.
void id_DelDiv | ( | ideal | id, |
const ring | r | ||
) |
delete id[j], if LT(j) == coeff*mon*LT(i) and vice versa, i.e., delete id[i], if LT(i) == coeff*mon*LT(j)
Definition at line 341 of file simpleideals.cc.
void id_DelEquals | ( | ideal | id, |
const ring | r | ||
) |
ideal id = (id[i]) if id[i] = id[j] then id[j] is deleted for j > i
Definition at line 290 of file simpleideals.cc.
void id_Delete | ( | ideal * | h, |
ring | r | ||
) |
void id_DelLmEquals | ( | ideal | id, |
const ring | r | ||
) |
Delete id[j], if Lm(j) == Lm(i) and both LC(j), LC(i) are units and j > i.
Definition at line 313 of file simpleideals.cc.
void id_DelMultiples | ( | ideal | id, |
const ring | r | ||
) |
ideal id = (id[i]), c any unit if id[i] = c*id[j] then id[j] is deleted for j > i
Definition at line 255 of file simpleideals.cc.
ideal id_FreeModule | ( | int | i, |
const ring | r | ||
) |
ideal id_Head | ( | ideal | h, |
const ring | r | ||
) |
Definition at line 805 of file simpleideals.cc.
Definition at line 1330 of file simpleideals.cc.
ideal id_Homogen | ( | ideal | h, |
int | varnum, | ||
const ring | r | ||
) |
BOOLEAN id_InsertPolyWithTests | ( | ideal | h1, |
const int | validEntries, | ||
const poly | h2, | ||
const bool | zeroOk, | ||
const bool | duplicateOk, | ||
const ring | r | ||
) |
insert h2 into h1 depending on the two boolean parameters:
Definition at line 685 of file simpleideals.cc.
Definition at line 1614 of file simpleideals.cc.
Definition at line 1466 of file simpleideals.cc.
ideal id_MaxIdeal | ( | const ring | r | ) |
ideal id_MaxIdeal | ( | int | deg, |
const ring | r | ||
) |
Definition at line 1004 of file simpleideals.cc.
Definition at line 1246 of file simpleideals.cc.
Definition at line 1200 of file simpleideals.cc.
ideal id_Mult | ( | ideal | h1, |
ideal | h2, | ||
const ring | R | ||
) |
h1 * h2 one h_i must be an ideal (with at least one column) the other h_i may be a module (with no columns at all)
Definition at line 726 of file simpleideals.cc.
|
static |
Definition at line 1033 of file simpleideals.cc.
void id_Norm | ( | ideal | id, |
const ring | r | ||
) |
void id_Normalize | ( | ideal | I, |
const ring | r | ||
) |
int id_PosConstant | ( | ideal | id, |
const ring | r | ||
) |
index of generator with leading term in ground ring (if any); otherwise -1
Definition at line 81 of file simpleideals.cc.
ideal id_Power | ( | ideal | given, |
int | exp, | ||
const ring | r | ||
) |
Definition at line 1060 of file simpleideals.cc.
Definition at line 1567 of file simpleideals.cc.
long id_RankFreeModule | ( | ideal | s, |
ring | lmRing, | ||
ring | tailRing | ||
) |
return the maximal component number found in any polynomial in s
Definition at line 781 of file simpleideals.cc.
int id_ReadOutPivot | ( | ideal | arg, |
int * | comp, | ||
const ring | r | ||
) |
Definition at line 1490 of file simpleideals.cc.
ideal id_ResizeModule | ( | ideal | mod, |
int | rows, | ||
int | cols, | ||
const ring | R | ||
) |
Definition at line 1278 of file simpleideals.cc.
void id_ShallowDelete | ( | ideal * | h, |
ring | r | ||
) |
void id_Shift | ( | ideal | M, |
int | s, | ||
const ring | r | ||
) |
Definition at line 1845 of file simpleideals.cc.
ideal id_SimpleAdd | ( | ideal | h1, |
ideal | h2, | ||
const ring | R | ||
) |
sorts the ideal w.r.t. the actual ringordering uses lex-ordering when nolex = FALSE
Definition at line 502 of file simpleideals.cc.
ideal id_Subst | ( | ideal | id, |
int | n, | ||
poly | e, | ||
const ring | r | ||
) |
Definition at line 1315 of file simpleideals.cc.
Definition at line 1716 of file simpleideals.cc.
ideal id_Transp | ( | ideal | a, |
const ring | rRing | ||
) |
ideal id_Vec2Ideal | ( | poly | vec, |
const ring | R | ||
) |
int idElem | ( | const ideal | F | ) |
void idGetNextChoise | ( | int | r, |
int | end, | ||
BOOLEAN * | endch, | ||
int * | choise | ||
) |
Definition at line 854 of file simpleideals.cc.
int idGetNumberOfChoise | ( | int | t, |
int | d, | ||
int | begin, | ||
int | end, | ||
int * | choise | ||
) |
Definition at line 880 of file simpleideals.cc.
ideal idInit | ( | int | idsize, |
int | rank | ||
) |
initialise an ideal / module
creates an ideal / module
Definition at line 36 of file simpleideals.cc.
void idInitChoise | ( | int | r, |
int | beg, | ||
int | end, | ||
BOOLEAN * | endch, | ||
int * | choise | ||
) |
Definition at line 832 of file simpleideals.cc.
BOOLEAN idInsertPoly | ( | ideal | h1, |
poly | h2 | ||
) |
insert h2 into h1 (if h2 is not the zero polynomial) return TRUE iff h2 was indeed inserted
Definition at line 639 of file simpleideals.cc.
BOOLEAN idInsertPolyOnPos | ( | ideal | I, |
poly | p, | ||
int | pos | ||
) |
BOOLEAN idIs0 | ( | ideal | h | ) |
Definition at line 58 of file simpleideals.cc.
void idSkipZeroes | ( | ideal | ide | ) |
|
static |
Definition at line 961 of file simpleideals.cc.
for idSort: compare a and b revlex inclusive module comp.
Definition at line 465 of file simpleideals.cc.
|
static |
Definition at line 30 of file simpleideals.cc.
|
static |
Definition at line 32 of file simpleideals.cc.
omBin sip_sideal_bin = omGetSpecBin(sizeof(sip_sideal)) |
Definition at line 28 of file simpleideals.cc.