![]() |
#include <polys/monomials/p_polys.h>
#include <Singular/ipid.h>
#include "singularWishlist.h"
#include "ppinitialReduction.h"
#include <map>
#include <set>
#include <exception>
Go to the source code of this file.
Functions | |
bool | isOrderingLocalInT (const ring r) |
void | divideByCommonGcd (poly &g, const ring r) |
void | pReduce (poly &g, const number p, const ring r) |
bool | p_xLeadmonomDivisibleBy (const poly g, const poly f, const ring r) |
void | pReduceInhomogeneous (poly &g, const number p, const ring r) |
void | ptNormalize (poly *gStar, const number p, const ring r) |
void | ptNormalize (ideal I, const number p, const ring r) |
BOOLEAN | ptNormalize (leftv res, leftv args) |
BOOLEAN | pReduceDebug (leftv res, leftv args) |
void | pReduce (ideal &I, const number p, const ring r) |
bool | ppreduceInitially (poly *hStar, const poly g, const ring r) |
reduces h initially with respect to g, returns false if h was initially reduced in the first place, returns true if reductions have taken place. More... | |
BOOLEAN | ppreduceInitially0 (leftv res, leftv args) |
bool | ppreduceInitially (ideal I, const number p, const ring r) |
BOOLEAN | ppreduceInitially1 (leftv res, leftv args) |
int | ppreduceInitially (ideal I, const number p, const poly g, const ring r) |
BOOLEAN | ppreduceInitially2 (leftv res, leftv args) |
static poly | ppNext (poly p, int l) |
static void | sortMarks (const ideal H, const ring r, std::vector< mark > &T) |
static poly | getTerm (const ideal H, const mark ab) |
static void | adjustMarks (std::vector< mark > &T, const int newEntry) |
static void | cleanupMarks (const ideal H, std::vector< mark > &T) |
bool | ppreduceInitially (ideal &H, const number p, const ideal G, const ring r) |
BOOLEAN | ppreduceInitially3 (leftv res, leftv args) |
bool | ppreduceInitially (ideal I, const ring r, const number p) |
reduces I initially with respect to itself. More... | |
BOOLEAN | reduceInitiallyDebug (leftv res, leftv args) |
Definition at line 623 of file ppinitialReduction.cc.
Definition at line 634 of file ppinitialReduction.cc.
Definition at line 26 of file ppinitialReduction.cc.
Definition at line 615 of file ppinitialReduction.cc.
bool isOrderingLocalInT | ( | const ring | r | ) |
Definition at line 13 of file ppinitialReduction.cc.
Definition at line 123 of file ppinitialReduction.cc.
Definition at line 575 of file ppinitialReduction.cc.
reduces h initially with respect to g, returns false if h was initially reduced in the first place, returns true if reductions have taken place.
assumes that h and g are in pReduced form and homogeneous in x of the same degree
Definition at line 322 of file ppinitialReduction.cc.
Definition at line 394 of file ppinitialReduction.cc.
Definition at line 478 of file ppinitialReduction.cc.
Definition at line 653 of file ppinitialReduction.cc.
reduces I initially with respect to itself.
assumes that the generators of I are homogeneous in x and that p-t is in I.
sorts Hi according to degree in t in descending order (lowest first, highest last)
Definition at line 773 of file ppinitialReduction.cc.
Definition at line 357 of file ppinitialReduction.cc.
Definition at line 441 of file ppinitialReduction.cc.
Definition at line 537 of file ppinitialReduction.cc.
Definition at line 739 of file ppinitialReduction.cc.
Definition at line 59 of file ppinitialReduction.cc.
Definition at line 301 of file ppinitialReduction.cc.
Definition at line 277 of file ppinitialReduction.cc.
Definition at line 137 of file ppinitialReduction.cc.
Definition at line 201 of file ppinitialReduction.cc.
Definition at line 245 of file ppinitialReduction.cc.
Definition at line 253 of file ppinitialReduction.cc.
Definition at line 876 of file ppinitialReduction.cc.
Definition at line 588 of file ppinitialReduction.cc.