Home
last modified time | relevance | path

Searched refs:ideal (Results 51 – 75 of 5354) sorted by relevance

12345678910>>...215

/dports/math/giacxcas/CoCoALib-0.99700/src/CoCoA-5/tests/
H A Danna.cocoa5219 TEST_ASSERT(ideal(x^2+2) * ideal(Qxy, []), ideal(Qxy, []));
220 TEST_ASSERT(ideal(Qxy, []) * ideal(x^2+2), ideal(Qxy, []));
221 TEST_ASSERT(ideal(Qxy, []) * ideal(Qxy, []), ideal(Qxy, []));
233 TEST_ASSERT(saturate(ideal(x,y-1), ideal(x,y-2)), ideal(x,y-1));
255 TEST_ASSERT(intersect(ideal(x*y), ideal(y*y)), ideal(x*y*y));
256 TEST_ASSERT(colon(ideal(x*y), ideal(y)), ideal(x));
257 TEST_ASSERT(ideal(x*y):ideal(y), ideal(x));
258 TEST_ASSERT(saturate(ideal(x*y^2), ideal(y)), ideal(x));
259 TEST_ASSERT(saturate(ideal(x*y^2), ideal(one(CurrentRing))), ideal(x*y^2));
261 TEST_ASSERT(saturate(ideal(x), ideal(x,y)), ideal(x));
[all …]
H A Dtest-FactorAlgExt.cocoa523 TEST_ASSERT(EqSet(Q,[ideal(x +a +1, a^2 +a +1), ideal(x +a, a^2 +a +1)]), true);
27 F4 := F2a/ideal(a^2+a+1);
39 TEST_ASSERT(EqSet(Q,[ideal(x +1, a^2 +a +1), ideal(a^2 +a +1, x^2)]), true);
43 F4 := F2a/ideal(a^2+a+1);
59 F4 := F2a/ideal(a^2+a+1);
75 F4 := F2a/ideal(a^2+a+1);
87 TEST_ASSERT(EqSet(Q,[ideal(x +1, a^2 +a +1), ideal(x +a, a^2 +a +1), ideal(x +a +1, a^2 +a +1)]), t…
105 TEST_ASSERT(EqSet(Q,[ideal(a^2 +x, x*a +a +1, x^2 +x +a),ideal(a^2 +x +a, x*a +x +1, x^2 +a),ideal(…
183 I := ideal(t^3+t-5, F);
199 I := ideal(t^3+t-5, F);
[all …]
H A Dlecture-HF2.cocoa5103 J : ideal(F); --> ideal(z, x)
109 J2 : ideal(F); --> ideal(x)
121 ideal(interreduced(gens(I + ideal(F))));
127 ideal(interreduced(gens(J + ideal(F))));
128 J:ideal(F);
140 ideal(interreduced(gens(I + ideal(F))));
141 I:ideal(F);
146 ideal(interreduced(gens(I + ideal(F))));
147 J:ideal(F);
159 ideal(interreduced(gens(I + ideal(F))));
[all …]
H A Dlecture-HF2.out16 ideal(z, x)
17 ideal(x)
18 ideal(y)
20 ideal(z, x)
21 ideal(x, y*z, y^2)
22 ideal(x*y, y^2*z)
23 ideal(z, y, x)
24 ideal(y)
25 ideal(x, y*z)
26 ideal(y^2, x*y)
[all …]
/dports/math/singular/Singular-Release-4-2-1/libpolys/polys/
H A Dmatpol.h95 void mp_RecMin(int, ideal, int &, matrix, int, int, poly, ideal, const ring);
96 void mp_MinorToResult(ideal, int &, matrix, int, int, ideal, const ring);
110 ideal sm_Add(ideal a, ideal b, const ring R);
111 ideal sm_Sub(ideal a, ideal b, const ring R);
112 ideal sm_Mult(ideal a, ideal b, const ring R);
113 ideal sm_Flatten(ideal a, const ring R);
114 ideal sm_UnFlatten(ideal a, int col, const ring R);
115 poly sm_Trace ( ideal a, const ring R);
116 int sm_Compare(ideal a, ideal b, const ring R);
117 BOOLEAN sm_Equal(ideal a, ideal b, const ring R);
[all …]
H A DprCopy.h33 ideal idrMoveR_NoSort(ideal &id, ring r, ring dest_r );
34 ideal idrMoveR(ideal &id, ring r, ring dest_r );
36 ideal idrCopyR_NoSort(ideal id, ring r, ring dest_r );
37 ideal idrCopyR(ideal id, ring r, ring dest_r );
39 ideal idrShallowCopyR_NoSort(ideal id, ring r, ring dest_r );
40 ideal idrShallowCopyR(ideal id, ring r, ring dest_r );
43 ideal idrHeadR(ideal id, ring r, ring dest_r );
/dports/math/frobby/frobby-0.9.1/src/
H A DIdealOrderer.cpp47 stable_sort(ideal.begin(), ideal.end(), pred); in doOrder()
55 void doOrder(Ideal& ideal) const { in doOrder()
56 random_shuffle(ideal.begin(), ideal.end()); in doOrder()
141 Term tmp(ideal.getVarCount()); in orderGenericity()
142 for (cit a = ideal.begin(); a != ideal.end(); ++a) { in orderGenericity()
157 stable_sort(ideal.begin(), ideal.end(), pred); in orderGenericity()
165 orderGenericity(ideal, true); in doOrder()
209 reverse(ideal.begin(), ideal.end()); in doOrder()
210 _orderer->order(ideal); in doOrder()
211 reverse(ideal.begin(), ideal.end()); in doOrder()
[all …]
H A DGenerateDataFacade.cpp31 ::generateLinkedListIdeal(ideal, varCount); in generateListIdeal()
40 ::generateKingChessIdeal(ideal, rowsAndColumns); in generateKingChessIdeal()
46 (BigIdeal& ideal, unsigned int rowsAndColumns) { in generateKnightChessIdeal() argument
49 ::generateKnightChessIdeal(ideal, rowsAndColumns); in generateKnightChessIdeal()
55 (BigIdeal& ideal, unsigned int n, unsigned int k) { in generateRookChessIdeal() argument
58 ::generateRookChessIdeal(ideal, n, k); in generateRookChessIdeal()
64 (BigIdeal& ideal, unsigned int n) { in generateMatchingIdeal() argument
67 ::generateMatchingIdeal(ideal, n); in generateMatchingIdeal()
73 (BigIdeal& ideal, in generateTreeIdeal() argument
77 ::generateTreeIdeal(ideal, varCount); in generateTreeIdeal()
[all …]
H A DTransformAction.cpp154 names = ideal.getNames(); in perform()
163 BigIdeal& ideal = *(ideals[i]); in perform() local
169 auto_ptr<BigIdeal> ideal; in perform() local
170 ideal.reset(new BigIdeal(names)); in perform()
179 BigIdeal& ideal = *(ideals[i]); in perform() local
182 idealFacade.takeRadical(ideal); in perform()
185 idealFacade.swap01(ideal); in perform()
191 idealFacade.deform(ideal); in perform()
198 BigIdeal& ideal = *(ideals[i]); in perform() local
201 idealFacade.addPurePowers(ideal); in perform()
[all …]
H A Dfrobby.h37 Ideal(const Ideal& ideal);
40 Ideal& operator=(const Ideal& ideal);
158 bool alexanderDual(const Ideal& ideal,
163 bool alexanderDual(const Ideal& ideal,
174 void multigradedHilbertPoincareSeries(const Ideal& ideal,
182 void univariateHilbertPoincareSeries(const Ideal& ideal,
202 void irreducibleDecompositionAsIdeals(const Ideal& ideal,
245 void maximalStandardMonomials(const Ideal& ideal,
265 bool solveStandardMonomialProgram(const Ideal& ideal,
283 void codimension(const Ideal& ideal, mpz_t codim);
[all …]
H A DPivotEulerAlg.cpp48 if (!ideal.hasFullSupport(eliminated)) in baseCaseSimple1()
133 if (ideal.getGeneratorCount() == 3) { in baseCasePreconditionSimplified()
150 size_t index = ideal.getMultiple(var); in optimizeOneDivCounts()
186 ideal.getLcmOfNonMultiples(tmp, var); in optimizeVarPairs()
257 if (ideal.getGeneratorCount() == 0) in computeEulerCharacteristic()
259 else if (ideal.getVarCount() == 0) in computeEulerCharacteristic()
262 const size_t maxDim = std::max(ideal.getVarCount(), ideal.getGeneratorCount()); in computeEulerCharacteristic()
275 (const RawSquareFreeIdeal& ideal) { in computeEulerCharacteristic() argument
280 if (ideal.getGeneratorCount() == 0) in computeEulerCharacteristic()
282 else if (ideal.getVarCount() == 0) in computeEulerCharacteristic()
[all …]
H A DSquareFreeIdeal.cpp28 _names(ideal.getNames()) { in SquareFreeIdeal()
30 if (_capacity < ideal.getGeneratorCount()) in SquareFreeIdeal()
31 _capacity = ideal.getGeneratorCount(); in SquareFreeIdeal()
33 _ideal->insert(*ideal._ideal); in SquareFreeIdeal()
37 _names(ideal.getNames()) { in SquareFreeIdeal()
38 _capacity = ideal.getGeneratorCount(); in SquareFreeIdeal()
40 _ideal->insert(ideal); in SquareFreeIdeal()
48 SquareFreeIdeal copy(ideal); in operator =()
96 std::swap(_names, ideal._names); in swap()
97 std::swap(_ideal, ideal._ideal); in swap()
[all …]
H A DScarfHilbertAlgorithm.cpp116 Ideal deformed(ideal); in runGeneric()
147 ideal.print(stderr); in initializeEnumeration()
158 _states[i].term.reset(ideal.getVarCount()); in initializeEnumeration()
159 _states[i].face.reserve(ideal.getVarCount()); in initializeEnumeration()
165 if (ideal.containsIdentity()) in initializeEnumeration()
170 _states[0].pos = ideal.begin(); in initializeEnumeration()
180 if (state.pos == ideal.end()) in doEnumerationStep()
200 if (state.face.size() == ideal.getVarCount() || state.pos == ideal.end()) in doEnumerationStep()
256 ASSERT(Ideal(ideal).isWeaklyGeneric()); in enumerateScarfComplex()
258 IdealTree tree(ideal); in enumerateScarfComplex()
[all …]
/dports/math/singular/Singular-Release-4-2-1/kernel/groebner_walk/
H A DwalkMain.cc72 ideal nextG; in firstWalkStep64()
197 nextG=(ideal)resMat; in walkStep64()
233 ideal G=I; in walk64()
245 ideal nextG; in walk64()
362 ideal nextG; in unperturbedFirstStep64()
516 ideal newGw; in fractalRec64()
517 ideal newStdGw; in fractalRec64()
518 ideal newG; in fractalRec64()
551 ideal recG=Gw; in fractalRec64()
583 G=(ideal)resMat; in fractalRec64()
[all …]
/dports/math/singular/Singular-Release-4-2-1/Singular/dyn_modules/syzextra/
H A Dsyzextra.h54 ideal id_Tail(const ideal id, const ring r);
393 inline void ReadOffResult(ideal& syzL, ideal& syzT) in ReadOffResult()
452 const ideal m_idLeads;
458 ideal m_syzLeads;
461 ideal m_syzTails;
494 static inline void ComputeSyzygy(const ideal L, const ideal T, ideal& LL, ideal& TT, const Schreyer… in ComputeSyzygy()
505 ideal LL, TT; in ComputeLeadingSyzygyTerms()
514 ideal LL, TT; in Compute2LeadingSyzygyTerms()
527 ideal L, ideal T, ideal LS, const SchreyerSyzygyComputationFlags A) in TraverseTail()
534 ideal L, ideal T, ideal LS, const SchreyerSyzygyComputationFlags A) in ReduceTerm()
[all …]
/dports/math/gap/gap-4.11.0/pkg/sonata-2.9.1/doc/ref/
H A Dideals.tex107 [ < nearring right ideal >, < nearring right ideal >,
128 [ < nearring ideal >, < nearring ideal >, < nearring ideal > ]
130 [ < nearring right ideal >, < nearring right ideal >,
133 [ < nearring left ideal >, < nearring left ideal >, < nearring left ideal >,
192 ideal.
261 as an ideal.
297 [ < nearring left ideal >, < nearring left ideal >,
298 < nearring left ideal >, < nearring left ideal >,
299 < nearring left ideal >, < nearring left ideal > ]
414 [ < nearring ideal >, < nearring ideal > ]
[all …]
/dports/math/cocoalib/CoCoALib-0.99712/src/CoCoA-5/tests/
H A Dtest-FactorAlgExt.cocoa523 TEST_ASSERT(EqSet(Q,[ideal(x +a +1, a^2 +a +1), ideal(x +a, a^2 +a +1)]), true);
27 F4 := F2a/ideal(a^2+a+1);
39 TEST_ASSERT(EqSet(Q,[ideal(x +1, a^2 +a +1), ideal(a^2 +a +1, x^2)]), true);
43 F4 := F2a/ideal(a^2+a+1);
59 F4 := F2a/ideal(a^2+a+1);
75 F4 := F2a/ideal(a^2+a+1);
87 TEST_ASSERT(EqSet(Q,[ideal(x +1, a^2 +a +1), ideal(x +a, a^2 +a +1), ideal(x +a +1, a^2 +a +1)]), t…
105 TEST_ASSERT(EqSet(Q,[ideal(a^2 +x, x*a +a +1, x^2 +x +a),ideal(a^2 +x +a, x*a +x +1, x^2 +a),ideal(…
183 I := ideal(t^3+t-5, F);
199 I := ideal(t^3+t-5, F);
[all …]
H A Dlecture-HF2.cocoa5103 J : ideal(F); --> ideal(z, x)
109 J2 : ideal(F); --> ideal(x)
121 ideal(interreduced(gens(I + ideal(F))));
127 ideal(interreduced(gens(J + ideal(F))));
128 J:ideal(F);
140 ideal(interreduced(gens(I + ideal(F))));
141 I:ideal(F);
146 ideal(interreduced(gens(I + ideal(F))));
147 J:ideal(F);
159 ideal(interreduced(gens(I + ideal(F))));
[all …]
H A Dlecture-HF2.out16 ideal(z, x)
17 ideal(x)
18 ideal(y)
20 ideal(z, x)
21 ideal(x, y*z, y^2)
22 ideal(x*y, y^2*z)
23 ideal(z, y, x)
24 ideal(y)
25 ideal(x, y*z)
26 ideal(y^2, x*y)
[all …]
/dports/math/cocoalib/CoCoALib-0.99712/src/tests/
H A Dtest-ideal1.C62 ideal I = ideal(g); in TestRing()
63 ideal J = ideal(f); in TestRing()
73 CoCoA_ASSERT_ALWAYS( !IsContained(ideal(g), ideal(f)) ); in TestRing()
75 CoCoA_ASSERT_ALWAYS( IsContained(ideal(f), ideal(g)) ); in TestRing()
78 CoCoA_ASSERT_ALWAYS( IsOne(ideal(f)) ); in TestRing()
80 CoCoA_ASSERT_ALWAYS( ideal(x[0])+ideal(x[1]) == ideal(x[0], x[1]) ); in TestRing()
81 CoCoA_ASSERT_ALWAYS( ideal(x[0],x[1])*ideal(x[1],x[2]) in TestRing()
83 CoCoA_ASSERT_ALWAYS( power(ideal(x[0],x[1]), 3) in TestRing()
84 == ideal(x[0],x[1])*ideal(x[0],x[1])*ideal(x[0],x[1])); in TestRing()
85 CoCoA_ASSERT_ALWAYS( IsZero(intersect(I, ideal(zero(P))))); in TestRing()
[all …]
/dports/math/giacxcas/CoCoALib-0.99700/src/tests/
H A Dtest-ideal1.C62 ideal I = ideal(g); in TestRing()
63 ideal J = ideal(f); in TestRing()
73 CoCoA_ASSERT_ALWAYS( !IsContained(ideal(g), ideal(f)) ); in TestRing()
75 CoCoA_ASSERT_ALWAYS( IsContained(ideal(f), ideal(g)) ); in TestRing()
78 CoCoA_ASSERT_ALWAYS( IsOne(ideal(f)) ); in TestRing()
80 CoCoA_ASSERT_ALWAYS( ideal(x[0])+ideal(x[1]) == ideal(x[0], x[1]) ); in TestRing()
81 CoCoA_ASSERT_ALWAYS( ideal(x[0],x[1])*ideal(x[1],x[2]) in TestRing()
83 CoCoA_ASSERT_ALWAYS( power(ideal(x[0],x[1]), 3) in TestRing()
84 == ideal(x[0],x[1])*ideal(x[0],x[1])*ideal(x[0],x[1])); in TestRing()
85 CoCoA_ASSERT_ALWAYS( IsZero(intersect(I, ideal(zero(P))))); in TestRing()
[all …]
/dports/math/frobby/frobby-0.9.1/test/idealFormats/
H A Dt6.newmonos1 (monomial-ideal-with-order
4 (monomial-ideal-with-order
8 (monomial-ideal-with-order
11 (monomial-ideal-with-order
15 (monomial-ideal-with-order
19 (monomial-ideal-with-order
23 (monomial-ideal-with-order
26 (monomial-ideal-with-order
29 (monomial-ideal-with-order
33 (monomial-ideal-with-order
[all …]
H A Dt6.singular3 ideal I =
7 ideal I =
11 ideal I =
15 ideal I =
19 ideal I =
23 ideal I =
27 ideal I =
31 ideal I =
35 ideal I =
39 ideal I =
[all …]
/dports/math/py-sympy/sympy-1.9/sympy/polys/agca/tests/
H A Dtest_ideals.py10 I = R.ideal(x)
11 J = R.ideal(y)
12 S = R.ideal(x*y)
13 T = R.ideal(x, y)
36 assert R.ideal() == R.ideal(0)
44 assert T**0 == R.ideal(1)
110 assert R.ideal(x, y).intersect(R.ideal(y**2, z)) == R.ideal(y**2, y*z, x*z)
112 assert R.ideal(x, y).intersect(R.ideal()).is_zero()
115 assert R.ideal(x, y).intersect(R.ideal(y**2 + y**2*z, z + z*x**3*y)) == \
122 assert R.ideal(x, y).quotient(R.ideal(y**2, z)) == R.ideal(x, y)
[all …]
/dports/deskutils/calibre/calibre-src-5.34.0/recipes/
H A Dideal_granada.recipe11 www.ideal.es
31 masthead_url = 'http://www.ideal.es/img/rd.logotipo2_ideal.gif'
51 (u'Portada', u'http://www.ideal.es/granada/portada.xml'),
52 (u'Local', u'http://www.ideal.es/granada/rss/feeds/granada.xml'),
53 (u'Deportes', u'http://www.ideal.es/granada/rss/feeds/deportes.xml'),
54 (u'Sociedad', u'http://www.ideal.es/granada/rss/feeds/sociedad.xml'),
55 (u'Cultura', u'http://www.ideal.es/granada/rss/feeds/cultura.xml'),
57 (u'Costa', u'http://www.ideal.es/granada/rss/feeds/costa.xml'),
61 (u'España', u'http://www.ideal.es/granada/rss/feeds/espana.xml'),
63 (u'Vivir', u'http://www.ideal.es/granada/rss/feeds/vivir.xml'),
[all …]

12345678910>>...215