/dports/math/giacxcas/CoCoALib-0.99700/include/CoCoA/ |
H A D | SparsePolyRing.H | 210 virtual void myAdd(const ideal&); 211 virtual void myMul(const ideal&); 213 virtual void myColon(const ideal&); 214 virtual void mySaturate(const ideal&); 276 ideal myRadical_0dimDRL() const; 283 ideal myRadical_MonId() const; 285 void myMul_MonId(const ideal&); 286 void myIntersect_MonId(const ideal&); 287 void myColon_MonId(const ideal&); 296 friend ideal radical_0dimDRL(const ideal& I); [all …]
|
/dports/math/frobby/frobby-0.9.1/src/ |
H A D | BigTermConsumer.cpp | 55 void BigTermConsumer::consume(const BigIdeal& ideal) { in consume() argument 56 consumeRing(ideal.getNames()); in consume() 57 beginConsuming(ideal.getNames()); in consume() 58 for (size_t term = 0; term < ideal.getGeneratorCount(); ++term) in consume() 59 consume(ideal.getTerm(term)); in consume() 63 void BigTermConsumer::consume(auto_ptr<BigIdeal> ideal) { in consume() argument 64 consume(*ideal); in consume()
|
H A D | IOFacade.h | 50 void readSatBinomIdeal(Scanner& in, SatBinomIdeal& ideal); 56 void readIdeal(Scanner& in, BigIdeal& ideal); 60 void readSquareFreeIdeal(Scanner& in, SquareFreeIdeal& ideal); 68 void writeIdeal(const BigIdeal& ideal, IOHandler* handler, FILE* out); 86 (Scanner& in, BigIdeal& ideal, vector<mpz_class>& instance); 90 (Scanner& in, BigIdeal& ideal, vector<mpz_class>& term); 95 void readLattice(Scanner& in, BigIdeal& ideal); 96 void writeLattice(FILE* out, const BigIdeal& ideal, const string& format);
|
H A D | LibStdProgramTest.cpp | 33 Frobby::Ideal ideal = toLibIdeal(IdealFactory::xx_yy_zz_t_xz_yz()); in TEST_SUITE2() local 38 (ideal, castLibArray(grading), consumer); in TEST_SUITE2() 50 Frobby::Ideal ideal = toLibIdeal(IdealFactory::xx_yy_zz_t_xz_yz()); in TEST() local 54 Frobby::solveStandardMonomialProgram(ideal, castLibArray(grading), consumer); in TEST() 67 Frobby::Ideal ideal(varCount); in TEST() local 72 (ideal, castLibArray(grading), consumer); in TEST() 91 Frobby::Ideal ideal = toLibIdeal(IdealFactory::wholeRing(varCount)); in TEST() local 96 (ideal, castLibArray(grading), consumer); in TEST()
|
H A D | LibIrreducibleDecomTest.cpp | 30 Frobby::Ideal ideal = toLibIdeal(IdealFactory::xx_yy_xz_yz()); in TEST_SUITE2() local 34 Frobby::irreducibleDecompositionAsMonomials(ideal, consumer); in TEST_SUITE2() 42 Frobby::Ideal ideal = toLibIdeal(IdealFactory::xx_yy_xz_yz()); in TEST() local 45 Frobby::irreducibleDecompositionAsIdeals(ideal, consumer); in TEST() 78 Frobby::Ideal ideal = toLibIdeal(IdealFactory::wholeRing(varCount)); in TEST() local 82 Frobby::irreducibleDecompositionAsMonomials(ideal, consumer); in TEST() 92 Frobby::Ideal ideal = toLibIdeal(IdealFactory::wholeRing(varCount)); in TEST() local 95 Frobby::irreducibleDecompositionAsIdeals(ideal, consumer); in TEST()
|
/dports/math/frobby/frobby-0.9.1/test/messages/ |
H A D | help-noparam.err | 5 alexdual - Compute the Alexander dual of the input ideal. 6 analyze - Display information about the input ideal. 7 assoprimes - Compute the associated primes of the input ideal. 8 dimension - Compute the (co)dimension of the input ideal. 12 genideal - Generate a random monomial ideal. 13 hilbert - Compute the Hilbert-Poincare series of the input ideal. 15 irrdecom - Compute the irreducible decomposition of the input ideal. 17 maxstandard - Compute the maximal standard monomials of the input ideal. 18 optimize - Solve optimization problems related to the input ideal. 21 transform - Change the representation of the input ideal.
|
/dports/math/fricas/fricas-1.3.7/src/input/ |
H A D | ideal.input | 7 id := ideal m + ideal n 9 zeroDim?(ideal m) 10 dimension ideal m 18 ld:=primaryDecomp(ideal l)$ID3 21 radical(ideal l)$ID3 22 quotient(ideal l,y)
|
/dports/math/gap/gap-4.11.0/pkg/NumericalSgps-1.2.1/gap/ |
H A D | ideals-def.gd | 49 ## returns the ideal of S generated by l. 62 ## Returns a set of generators of the ideal I. 76 ## Returns a set of generators of the ideal I. 86 ## Returns the ambient semigroup of the ideal I. 115 ## returns the ideal I - J 124 ## Tests if the integer n belongs to the ideal I. 145 ## n is a non negative integer and I is an ideal 167 ## Computes the Blow Up (of the maximal ideal) of 232 ## Returns the maximal ideal of S. 297 ## Computes a canonical ideal of <s> ([B06]): [all …]
|
/dports/math/singular/Singular-Release-4-2-1/Singular/ |
H A D | fglm.cc | 57 ideal fglmUpdatesource( const ideal sourceIdeal ) in fglmUpdatesource() 283 ideal destIdeal = NULL; in fglmProc() 350 ideal fglmQuot( ideal first, poly second ) in fglmQuot() 356 ideal destIdeal = NULL; in fglmQuot() 416 ideal sourceIdeal = (ideal)first->Data(); in fglmQuotProc() 418 ideal destIdeal = NULL; in fglmQuotProc() 474 ideal findUni( ideal first ) in findUni() 476 ideal sourceIdeal; in findUni() 477 ideal destIdeal = NULL; in findUni() 543 ideal sourceIdeal; in findUniProc() [all …]
|
/dports/math/singular/Singular-Release-4-2-1/kernel/groebner_walk/ |
H A D | walkMain.h | 52 WalkState walkstep64(ideal & G,int64vec* currw,int step); 53 WalkState walk64(ideal I,int64vec* currw64,ring destRing,int64vec* destVec64,ideal & destIdeal,BOO… 57 WalkState fractalWalk64(ideal sourceIdeal,ring destRing,ideal & destIdeal,BOOLEAN sourceIsSB,BOOLEA… 59 WalkState unperturbedFirstStep64(ideal & G,int64vec* currw64, ring destRing);
|
/dports/math/cocoalib/CoCoALib-0.99712/examples/ |
H A D | ex-frobby1.C | 38 ideal I = ideal(x*x, x*y, y*y, z*z); in program() 47 vector<ideal> ID; in program() 53 vector<ideal> PD; in program() 58 vector<ideal> AP; in program() 64 << FrbDimension(ideal(x, y)) << endl << endl; in program() 67 << FrbMultigradedHilbertPoincareNumerator(ideal(x, y)) << endl << endl; in program() 70 << FrbTotalDegreeHilbertPoincareNumerator(ideal(x,y), x + 2 * y) << endl << endl; in program()
|
/dports/math/giacxcas/CoCoALib-0.99700/examples/ |
H A D | ex-frobby1.C | 38 ideal I = ideal(x*x, x*y, y*y, z*z); in program() 47 vector<ideal> ID; in program() 53 vector<ideal> PD; in program() 58 vector<ideal> AP; in program() 64 << FrbDimension(ideal(x, y)) << endl << endl; in program() 67 << FrbMultigradedHilbertPoincareNumerator(ideal(x, y)) << endl << endl; in program() 70 << FrbTotalDegreeHilbertPoincareNumerator(ideal(x,y), x + 2 * y) << endl << endl; in program()
|
/dports/math/reduce/Reduce-svn5758-src/doc/manual/ |
H A D | ideals.tex | 24 An ideal is represented by a basis (set of polynomials) tagged 37 have to be used for ideal arithmetic: 40 .+ ideal sum (infix) 41 .* ideal product (infix) 42 .: ideal quotient (infix) 43 ./ ideal quotient (infix) 44 .= ideal equality test (infix) 45 subset ideal inclusion test (infix) 46 intersection ideal intersection (prefix,binary) 47 member test for membership in an ideal [all …]
|
/dports/math/cocoalib/CoCoALib-0.99712/src/AlgebraicCore/ |
H A D | SparsePolyOps-ideal-ZeroDim.C | 210 bool IsPrimary_0dimFin(const ideal& I) in IsPrimary_0dimFin() 235 ideal RadPartial_withGB = I; in myTestIsPrimary_0dim() 236 ideal RadCurrent = I; in myTestIsPrimary_0dim() 290 const ideal J = RadCurrent; in myTestIsPrimary_0dim() 345 ideal RadCurrent = I; in myRadical_0dimDRL() 346 ideal RadPartial_withGB = I; in myRadical_0dimDRL() 660 Q = std::vector<ideal>(1, ideal(const_cast<IdealImpl*>(this))); in myPrimaryDecompositionCore_0dim() 665 vector<ideal> Qi; in myPrimaryDecompositionCore_0dim() 720 return std::vector<ideal>(1, ideal(const_cast<IdealImpl*>(this))); in myPrimaryDecomposition_0dim() 721 std::vector<ideal> Q; in myPrimaryDecomposition_0dim() [all …]
|
/dports/math/giacxcas/CoCoALib-0.99700/src/AlgebraicCore/ |
H A D | SparsePolyOps-ideal-ZeroDim.C | 210 bool IsPrimary_0dimFin(const ideal& I) in IsPrimary_0dimFin() 235 ideal RadPartial_withGB = I; in myTestIsPrimary_0dim() 236 ideal RadCurrent = I; in myTestIsPrimary_0dim() 290 const ideal J = RadCurrent; in myTestIsPrimary_0dim() 345 ideal RadCurrent = I; in myRadical_0dimDRL() 346 ideal RadPartial_withGB = I; in myRadical_0dimDRL() 660 Q = std::vector<ideal>(1, ideal(const_cast<IdealImpl*>(this))); in myPrimaryDecompositionCore_0dim() 665 vector<ideal> Qi; in myPrimaryDecompositionCore_0dim() 720 return std::vector<ideal>(1, ideal(const_cast<IdealImpl*>(this))); in myPrimaryDecomposition_0dim() 721 std::vector<ideal> Q; in myPrimaryDecomposition_0dim() [all …]
|
/dports/math/giacxcas/CoCoALib-0.99700/src/tests/ |
H A D | test-bug1.C | 44 ideal I(foo); in OldBug1() 76 const ideal I1 = ideal(v); in redmine870() 79 const ideal I2 = ideal(v); in redmine870() 81 const ideal I3 = I1*I2; in redmine870() 82 const ideal I4 = I2*I1; in redmine870() 162 ideal I(zero(QQx)); in redmine1322() 170 ideal I1(RingElems(P, "x,y")); in redmine1379() 172 ideal I2(RingElems(P, "x,z")); in redmine1379() 174 ideal I3(RingElems(P, "y,z")); in redmine1379() 176 ideal I4(RingElems(P, "x,y,z")); in redmine1379() [all …]
|
H A D | test-hilbert1.C | 51 ideal NewQueenMovesFrom(SparsePolyRing P, long Csb, long sq1, long sq2) in NewQueenMovesFrom() 63 return ideal(P, g); // ideal(P, g) because g might be empty in NewQueenMovesFrom() 67 ideal NewQueenIdeal(SparsePolyRing P, long Csb) in NewQueenIdeal() 69 ideal I = ideal(zero(P)); in NewQueenIdeal() 88 ideal I = ideal(zero(P)); in program() 92 I = ideal(x[1], x[2], x[3]); in program() 108 ideal Q3 = NewQueenIdeal(CsbRing, 3); in program() 115 ideal Q4 = NewQueenIdeal(CsbRing, 4); in program() 122 ideal Q6 = NewQueenIdeal(CsbRing, 6); in program()
|
/dports/math/cocoalib/CoCoALib-0.99712/src/tests/ |
H A D | test-hilbert1.C | 51 ideal NewQueenMovesFrom(SparsePolyRing P, long Csb, long sq1, long sq2) in NewQueenMovesFrom() 63 return ideal(P, g); // ideal(P, g) because g might be empty in NewQueenMovesFrom() 67 ideal NewQueenIdeal(SparsePolyRing P, long Csb) in NewQueenIdeal() 69 ideal I = ideal(zero(P)); in NewQueenIdeal() 88 ideal I = ideal(zero(P)); in program() 92 I = ideal(x[1], x[2], x[3]); in program() 108 ideal Q3 = NewQueenIdeal(CsbRing, 3); in program() 115 ideal Q4 = NewQueenIdeal(CsbRing, 4); in program() 122 ideal Q6 = NewQueenIdeal(CsbRing, 6); in program()
|
/dports/math/singular/Singular-Release-4-2-1/kernel/maps/ |
H A D | gen_maps.h | 12 ideal maMapIdeal(const ideal map_id, const ring map_r,const ideal image_id, const ring image_r, con… 20 poly maMapPoly(const poly map_p, const ring map_r,const ideal image_id, const ring image_r, const n… 23 ideal id_SubstPoly (ideal id, int var, poly image, const ring preimage_r, const ring image_r, const…
|
/dports/math/singular/Singular-Release-4-2-1/libpolys/polys/ |
H A D | sparsmat.h | 27 poly sm_CallDet(ideal I, const ring); 28 void sm_CallBareiss(ideal smat, int x, int y, ideal & M, intvec ** iv, const ring); 29 ideal sm_CallSolv(ideal I, const ring); 33 long sm_ExpBound(ideal, int, int, int, const ring);
|
/dports/math/gap/gap-4.11.0/pkg/LocalizeRingForHomalg-2019.09.02/gap/ |
H A D | FakeLocalizeRing.gd | 21 #! Generators of prime ideal at which the base of the fake local ring is localized at 40 # Here we want to localize at a prime ideal p in k[X] 43 #! Constructor for the fake ring localized at prime ideal 50 #! Constructor for the fake ring localized at prime ideal 56 #! Constructor for elements of fake local ring localized at prime ideal 67 #! Constructor for matrices over fake local ring localized at prime ideal 73 #! Returns globalR modulo the prime ideal 79 #! Returns globalR modulo the prime ideal 85 #! Returns globalR modulo the prime ideal
|
/dports/math/gap/gap-4.11.0/pkg/semigroups-3.2.3/gap/ideals/ |
H A D | ideals.gd | 25 # the <Parent> of an ideal is the semigroup in which the ideal was created, 28 # which are used to compute the ideal. For a regular semigroup ideal, 30 # any of the predecessors of the current ideal. For example, if <S> is a 31 # semigroup, <I> is a regular ideal of <S>, and <J> is an ideal of <I>, then 37 # If <S> is a semigroup, <I> is a non-regular ideal of <S>, <J> is an ideal of
|
/dports/math/giacxcas/CoCoALib-0.99700/src/CoCoA-5/packages/ |
H A D | PrimaryDecompositionGTZ0.cpkg5 | 14 -- decomposition of a zero dimensional ideal. 45 Prime := ideal(P); //Prime.GBasis := Prime.Gens; 56 Prime := Prime + ideal(monic(T)); 66 Prime := ideal(P); //Prime.GBasis := Prime.Gens; 79 Prime := Prime + ideal(monic(T)); 126 PhiI := ideal(apply(Phi, gens(I))); 147 Primary := ideal(ReducedGBasis(PhiI+ideal(f))); 151 append(ref Rest, I_ + ideal(PhiInv(f))); 155 primary:=ideal(ReducedGBasis(I_ + ideal(PhiInv(f)))), 156 prime:=ideal(ReducedGBasis(ideal(apply(PhiInv,gens(Prime)))))]); [all …]
|
/dports/math/cocoalib/CoCoALib-0.99712/src/CoCoA-5/packages/ |
H A D | PrimaryDecompositionGTZ0.cpkg5 | 14 -- decomposition of a zero dimensional ideal. 45 Prime := ideal(P); //Prime.GBasis := Prime.Gens; 56 Prime := Prime + ideal(monic(T)); 66 Prime := ideal(P); //Prime.GBasis := Prime.Gens; 79 Prime := Prime + ideal(monic(T)); 126 PhiI := ideal(apply(Phi, gens(I))); 147 Primary := ideal(ReducedGBasis(PhiI+ideal(f))); 151 append(ref Rest, I_ + ideal(PhiInv(f))); 155 primary:=ideal(ReducedGBasis(I_ + ideal(PhiInv(f)))), 156 prime:=ideal(ReducedGBasis(ideal(apply(PhiInv,gens(Prime)))))]); [all …]
|
/dports/math/giacxcas/CoCoALib-0.99700/src/CoCoA-5/tests/ |
H A D | exbugs.cocoa5 | 36 I := ideal(zero(R)); 67 ideal(x,y)*ideal(x-1,y-1)*ideal(x-2,y-2) = ideal(y^3 -3*y^2 +2*y, x -y); 83 K := Fpt/ideal(t^3+t-5); 94 IsRadical(ideal(x+y,x-x)); 103 I1 := ideal(x,zero(R)); 104 I2 := ideal(y); 166 I1 := ideal(x-z^2, y-z^3-3*z-1, z^3-z-1); 167 I2 := ideal(x-5, y, z)^2; 168 I3 := ideal(x^2, y-2, z-1); 176 I := ideal(y*z -2*z^5 -2*z^4 +2*z^3, [all …]
|