125 for (
int i=1;
i<
k;
i++)
143 for (std::set<gfan::ZCone>::iterator zc=C.begin(); zc!=C.end();)
145 gfan::ZVector
w = zc->getRelativeInteriorPoint();
146 gfan::ZMatrix W = zc->generatorsOfSpan();
152 for (
int j=0;
j<
k;
j++)
157 ideal ininIs =
initial(inIsSTD,s,w,W);
161 if (mons.first!=
NULL)
166 gs = inIsSTD->m[mons.second];
169 gs =
witness(mons.first,inIsSTD,ininIs,s);
197 if (zc->contains(wNeg))
202 for (
int j=0;
j<
k;
j++)
207 ininIs =
initial(inIsSTD,s,wNeg,W);
210 if (mons.first!=
NULL)
215 gs = inIsSTD->m[mons.second];
218 gs =
witness(mons.first,inIsSTD,ininIs,s);
const CanonicalForm int s
static ring genericlyWeightedOrdering(const ring r, const gfan::ZVector &u, const gfan::ZVector &w, const gfan::ZMatrix &W, const tropicalStrategy *currentStrategy)
ZConesSortedByDimension tropicalVarietySortedByDimension(const poly g, const ring r, const tropicalStrategy *currentCase)
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
gfan::ZVector negateWeight(const gfan::ZVector &w) const
int getExpectedDimension() const
returns the expected Dimension of the polyhedral output
poly initial(const poly p, const ring r, const gfan::ZVector w)
Returns the initial form of p with respect to w.
poly p_PermPoly(poly p, const int *perm, const ring oldRing, const ring dst, nMapFunc nMap, const int *par_perm, int OldPar, BOOLEAN use_mult)
std::set< gfan::ZCone, ZConeCompareDimensionFirst > ZConesSortedByDimension
ideal gfanlib_kStd_wrapper(ideal I, ring r, tHomog h=testHomog)
BOOLEAN idInsertPoly(ideal h1, poly h2)
insert h2 into h1 (if h2 is not the zero polynomial) return TRUE iff h2 was indeed inserted ...
static ZConesSortedByDimension intersect(const ZConesSortedByDimension &setA, const ZConesSortedByDimension &setB, int d=0)
static FORCE_INLINE nMapFunc n_SetMap(const coeffs src, const coeffs dst)
set the mapping function pointers for translating numbers from src to dst
static void p_Delete(poly *p, const ring r)
ideal idInit(int idsize, int rank)
initialise an ideal / module
poly witness(const poly m, const ideal I, const ideal inI, const ring r)
Let w be the uppermost weight vector in the matrix defining the ordering on r.
void rDelete(ring r)
unconditionally deletes fields in r
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
std::pair< poly, int > checkInitialIdealForMonomial(const ideal I, const ring r, const gfan::ZVector &w=0) const
If given w, assuming w is in the Groebner cone of the ordering on r and I is a standard basis with re...