/dports/math/py-sympy/sympy-1.9/sympy/holonomic/ |
H A D | holonomic.py | 481 self.annihilator = annihilator 566 if self.annihilator.parent.base != other.annihilator.parent.base: 875 ann = self.annihilator 921 if self.annihilator == other.annihilator: 936 ann_self = self.annihilator 955 if self.annihilator.parent.base != other.annihilator.parent.base: 1134 ann = self.annihilator 1199 a = self.annihilator.order 2609 annihilator = Holonomic.annihilator 2610 a = annihilator.order [all …]
|
H A D | numerical.py | 15 ann = func.annihilator
|
/dports/news/c-nocem/c-nocem/ |
H A D | ncmperm | 10 annihilator-1 spam yes 11 annihilator-1 binary yes 12 annihilator-1 abuse yes 13 annihilator-1 forged-approval yes
|
H A D | ncmring.asc | 144 pub 512/02216DD9 1998/03/01 Annihilator <annihilator-1@erlenstar.demon.co.uk>
|
/dports/math/py-sympy/sympy-1.9/doc/src/modules/holonomic/ |
H A D | represent.rst | 6 Class :class:`DifferentialOperator` is used to represent the annihilator 19 equation in the form of annihilator. Basically a differential operator is an 26 The part left of :math:`y(x)` is the annihilator i.e. :math:`D^{2}+1`.
|
H A D | about.rst | 35 Here `D` is the Differential Operator and `L` is called the annihilator 38 A unique holonomic function can be defined from the annihilator and a set of
|
/dports/devel/py-boolean.py/boolean.py-3.8/boolean/ |
H A D | boolean.py | 1001 annihilator = getattr(self, 'annihilator', None) 1002 if annihilator is not None: 1003 debug_details += ', annihilator=%r' % (annihilator) 1142 self.annihilator = None 1198 if self.annihilator in expr.args: 1199 return self.annihilator 1219 return self.annihilator 1470 self.annihilator = self.FALSE 1496 self.annihilator = self.TRUE
|
/dports/math/gap/gap-4.11.0/pkg/ModulePresentationsForCAP-2019.01.16/doc/ |
H A D | manual.six | 28 [ 2, 1, 0 ], 4, 10, "annihilator", "X7FFB58F67850769C" ], 133 [ 1, 3, 11 ], 234, 7, "annihilator for isleftorrightpresentation",
|
/dports/math/gap/gap-4.11.0/pkg/ModulePresentationsForCAP-2019.01.16/gap/ |
H A D | ModulePresentationObject.gd | 134 #! The output is the embedding of the annihilator $I$ of $A$ 136 #! In particular, the annihilator itself is seen as a left or right presentation.
|
/dports/math/reduce/Reduce-svn5758-src/packages/cali/ |
H A D | quot.red | 89 % ---- The annihilator of a module, i.e. Ann coker M := M : F --- 91 symbolic operator annihilator; 92 symbolic procedure annihilator m;
|
/dports/textproc/texi2html/texi2html-5.0/test/singular_manual/ |
H A D | start.tex | 273 * Modules and their annihilator:: 826 @node Change of rings, Modules and their annihilator, Procedures and libraries, Getting started 957 @c @node Maps and elimination, Modules and their annihilator, Change of rings, Getting started 962 @node Modules and their annihilator, Resolution, Change of rings, Getting started 964 @subsection Modules and their annihilator 967 @section Modules and their annihilator 969 @cindex Modules and and their annihilator 1049 We want to calculate, as an application, the annihilator of a given module. 1069 Then, by definition, the annihilator of M is the ideal 1101 @node Resolution, , Modules and their annihilator, Getting started
|
/dports/math/gap/gap-4.11.0/pkg/homalg-2019.09.01/gap/ |
H A D | HomalgElement.gd | 115 ## The annihilator of the object element <A>e</A> as a subobject of the structure object.
|
/dports/math/stp/stp-2.3.3/lib/Simplifier/ |
H A D | Simplifier.cpp | 1145 const ASTNode annihilator = in SimplifyAndOrFormula() local 1162 if (annihilator == aaa) in SimplifyAndOrFormula() 1165 UpdateSimplifyMap(*i, annihilator, pushNeg, VarConstMap); in SimplifyAndOrFormula() 1166 UpdateSimplifyMap(a, annihilator, pushNeg, VarConstMap); in SimplifyAndOrFormula() 1168 return annihilator; in SimplifyAndOrFormula() 1182 UpdateSimplifyMap(a, annihilator, pushNeg, VarConstMap); in SimplifyAndOrFormula() 1184 return annihilator; in SimplifyAndOrFormula() 2683 const ASTNode annihilator = (BVAND == k) ? zero : max; in simplify_term_switch() local 2693 if (aaa == annihilator) in simplify_term_switch() 2695 output = annihilator; in simplify_term_switch() [all …]
|
/dports/games/stonesoup/crawl-0.27.1/crawl-ref/source/dat/des/variable/ |
H A D | lemuel_castle.des | 71 .. " / frost giant / tengu reaver / deep elf annihilator" 83 e.kmons("2 = yellow draconian monk / purple draconian annihilator"
|
H A D | grated_community.des | 238 MONS: deep elf annihilator / draconian annihilator / draconian scorcher
|
H A D | large_themed.des | 952 MONS: draconian shifter / draconian annihilator / lich / deep elf sorcerer / \ 953 deep elf annihilator / deep elf demonologist 1075 MONS: deep troll earth mage / deep elf sorcerer / deep elf annihilator \ 1080 MONS: tengu reaver / deep elf annihilator / deep elf sorcerer \ 1198 KMONS: 5 = nikola / jorgrun, deep elf annihilator 1201 MONS: tengu conjurer / wizard / spriggan air mage / deep elf annihilator 1202 MONS: deep elf annihilator / tengu reaver / lich, salamander tyrant 1349 mons = add_mons(mons, "deep elf annihilator", peak(depth, 30, 31, 4)) 2115 KMONS: 9 = glowing shapeshifter / spriggan defender / deep elf annihilator
|
/dports/games/stonesoup/crawl-0.27.1/crawl-ref/source/dat/des/branches/ |
H A D | elf.des | 66 e.mons("deep elf annihilator / deep elf elementalist w:3") 75 e.kmons("$ = w:450 nothing / deep elf sorcerer / deep elf annihilator") 76 e.kmons("* = w:300 nothing / deep elf annihilator / deep elf death mage") 385 MONS: deep elf annihilator / deep elf sorcerer 1037 KMONS: 2 = deep elf annihilator / deep elf sorcerer w:2 1399 MONS: deep elf annihilator, deep elf demonologist 1424 MONS: deep elf sorcerer / deep elf annihilator w:2 1450 MONS: deep elf sorcerer / deep elf annihilator 1540 MONS: deep elf annihilator, deep elf elementalist 2671 KMONS: $ = weight:115 nothing / deep elf annihilator [all …]
|
H A D | depths_encompass.des | 197 MONS: tengu reaver / deep elf annihilator / deep elf high priest \ 629 deep elf annihilator ; ice dragon scales | fire dragon scales . \ 646 KMONS: 8 = titan / draconian annihilator w:5 840 deep elf annihilator w:4 / deep elf sorcerer w:4 / \ 853 draconian monk / draconian annihilator / draconian knight / \ 855 KMONS: Z = draconian knight / draconian annihilator
|
/dports/games/stonesoup/crawl-0.27.1/crawl-ref/source/dat/des/sprint/ |
H A D | arena_sprint.des | 381 "deep elf high priest / deep elf demonologist / deep elf annihilator /\ 450 "deep elf high priest / deep elf demonologist / deep elf annihilator /\ 524 "deep elf high priest / deep elf demonologist / deep elf annihilator /\ 598 "deep elf high priest / deep elf demonologist / deep elf annihilator /\ 618 white draconian annihilator", 720 "deep elf master archer / deep elf annihilator / deep elf high priest", 754 "glowing orange brain / titan / lich / draconian annihilator / " .. 755 "deep elf annihilator", "lom lobon", "magical rune of zot"}
|
H A D | fedhas.des | 47 KMONS: f = oklob plant name:annihilator n_suf \
|
H A D | red_sonja.des | 49 KMONS: o = deep elf annihilator
|
/dports/games/stonesoup/crawl-0.27.1/crawl-ref/source/dat/des/builder/ |
H A D | rooms.des | 294 mons[3] = "deep elf annihilator w:6" 307 mons[13] = "draconian annihilator w:5"
|
/dports/math/stp/stp-2.3.3/lib/AST/NodeFactory/ |
H A D | SimplifyingNodeFactory.cpp | 409 const ASTNode& annihilator = (IsAnd ? ASTFalse : ASTTrue); in CreateSimpleAndOr() local 428 return annihilator; in CreateSimpleAndOr() 430 if (*it == annihilator) in CreateSimpleAndOr() 432 return annihilator; in CreateSimpleAndOr()
|
/dports/math/singular/Singular-Release-4-2-1/libpolys/coeffs/ |
H A D | README.coeffs | 53 a generator for the annihilator
|
/dports/math/gap/gap-4.11.0/pkg/Modules-2019.09.02/gap/ |
H A D | LIMOD.gi | 347 ## Z/2 is torsion-free over Z/6 with annihilator <3> 524 ## Z/2 is torsion-free over Z/6 with annihilator <3> 867 ## Z/2 is torsion-free over Z/6 with annihilator <3> 882 ## now that the annihilator is nontrivial 1472 ## Z/2 is torsion-free over Z/6 with annihilator <3>
|