Home
last modified time | relevance | path

Searched refs:preim (Results 1 – 19 of 19) sorted by relevance

/dports/math/gap/gap-4.11.0/pkg/corelg-1.54/gap/
H A DotherStuff.gi48 local F, V, kern, rws, i, new, elts, exps, preim, toExp, bas, mm;
67 preim := List(elts,x->SolutionMat(mm,x[Length(x)])); #need preim in rws[i]
68 preim := List(preim,x-> x*BasisVectors(Basis(rws[i])));
72 for i in [1..Length(elts)] do Add(elts[i],preim[i]); od;
/dports/math/fricas/fricas-1.3.7/src/algebra/
H A Dperm.spad225 preim := p.1
228 while not(empty?(preim)) repeat
230 firstEltInCycle : S := first preim
232 preim := rest preim
237 i := position(nextEltInCycle, preim)
238 preim := delete(preim, i)
383 preim := []$(L S)
387 preim := cons(first pair, preim)
389 duplicates?(preim) or duplicates?(im) or set(preim)$(Set S) _
392 [preim, im]
H A Dgraph.spad2465 --preim: List S := lr.preimage
2467 -- once only. preim should contain the same objects so there
2479 preim : List S := lr.preimage
2482 pout : Integer := position(preim.pt, obs)$List(S)
3133 preim : List S := lr.preimage
3136 for j in 1..#preim repeat
3137 if im.i = preim.j then n := j
4325 preim : List S := lr.preimage
4327 -- once only. preim should contain the same objects so there
4339 preim : List S := lr.preimage
[all …]
/dports/math/gap/gap-4.11.0/pkg/anupq-3.2.1/src/
H A Dmap_relations.c372 int preim, value; in print_image_under_aut() local
386 preim = preimage[i]; in print_image_under_aut()
387 s = (preim != 0) ? "x" : "y"; in print_image_under_aut()
388 value = (preim != 0) ? preim : i; in print_image_under_aut()
/dports/math/fricas/fricas-1.3.7/pre-generated/src/algebra/
H A DPERM.lsp138 (|im| #1=(|List| S)) (|nextEltInCycle| (S)) (|preim| #1#)
140 (SEQ (LETT |preim| (SPADCALL |p| 1 (QREFELT $ 25)))
142 (SEQ G190 (COND ((NULL (NULL (NULL |preim|))) (GO G191)))
143 (SEQ (LETT |firstEltInCycle| (|SPADfirst| |preim|))
146 (LETT |preim| (CDR |preim|))
159 (SPADCALL |nextEltInCycle| |preim|
161 (LETT |preim|
483 (SEQ (LETT |preim| NIL) (LETT |im| NIL)
494 (SEQ (LETT |preim| (CONS (|SPADfirst| |pair|) |preim|))
503 (SPADCALL (SPADCALL |preim| (QREFELT $ 44))
[all …]
H A DFNGRPH.lsp107 (|preim| #4=(|List| S)) (|im| #5=(|List| S))
116 (LETT |preim| (QCAR |lr|))
124 (SEQ (LETT |j| 1) (LETT #1# (LENGTH |preim|)) G190
130 (SPADCALL |preim| |j| (QREFELT $ 31))
H A DMFGRPH.lsp150 (#7=#:G607 NIL) (|pt| NIL) (|preim| #8=(|List| S))
166 (LETT |im| (QCDR |lr|)) (LETT |preim| (QCAR |lr|))
216 (LETT |im| (QCDR |lr|)) (LETT |preim| (QCAR |lr|))
227 (SPADCALL |preim| |pt| (QREFELT $ 24))
H A DDGRPH.lsp233 (#9=#:G652 NIL) (|pt| NIL) (|preim| #10=(|List| S))
299 (LETT |im| (QCDR |lr|)) (LETT |preim| (QCAR |lr|))
310 (SPADCALL |preim| |pt| (QREFELT $ 43))
/dports/math/gismo/gismo-21.12.0/src/gsCore/
H A DgsMultiPatch.hpp667 gsMatrix<T> & preim, const T accuracy) const in locatePoints() argument
671 preim.resize(parDim(), points.cols());//uninitialized by default in locatePoints()
686 preim.col(i) = tmp; in locatePoints()
695 gsVector<index_t> & pid2, gsMatrix<T> & preim) const in locatePoints()
700 preim.resize(parDim(), points.cols());//uninitialized by default in locatePoints()
717 preim.col(i) = tmp; in locatePoints()
H A DgsMultiPatch.h306 …void locatePoints(const gsMatrix<T> & points, gsVector<index_t> & pids, gsMatrix<T> & preim, const…
312 …nts(const gsMatrix<T> & points, index_t pid1, gsVector<index_t> & pid2, gsMatrix<T> & preim) const;
/dports/math/gap/gap-4.11.0/lib/
H A Dmapprep.gi1820 local preim;
1824 preim:=Intersection(Source(res),preim);
1826 return preim;
1839 local preim;
1843 preim:=Intersection(Source(res),preim);
1845 return preim;
1858 local preim, rep;
1860 if preim = fail then
1863 elif preim in Source(res) then
1864 return preim;
[all …]
H A Dmapphomo.gd635 local preim, gen;
652 preim:= PreImagesRange( map1 );
653 if not IsStruct( preim ) then
656 for gen in GeneratorsOfStruct( preim ) do
672 local preim, gen;
H A Dgrpmat.gi1027 preim,
1044 preim:= [];
1064 preim[i]:= row;
1067 return preim;
/dports/math/cocoalib/CoCoALib-0.99712/src/AlgebraicCore/
H A DHomomorphismOps.C372 RingElem preim = RichPhi.HomRS_R(candidate); in Preimage0RichHom() local
376 preim = CanonicalHom(RichPhi.R,domain(Phi))(preim); in Preimage0RichHom()
379 return preim; in Preimage0RichHom()
/dports/math/giacxcas/CoCoALib-0.99700/src/AlgebraicCore/
H A DHomomorphismOps.C371 RingElem preim = RichPhi.HomRS_R(candidate); in Preimage0RichHom() local
375 preim = CanonicalHom(RichPhi.R,domain(Phi))(preim); in Preimage0RichHom()
378 return preim; in Preimage0RichHom()
/dports/math/gap/gap-4.11.0/pkg/recog-1.3.2/misc/colva/
H A DRearrange.g100 local x,riker,aut,w,preim,t,inns,i,innspreims,y,l,rihom,kerhom
112 local w,preim;
114 preim := ResultOfStraightLineProgram(w,pregensfac(riker));
115 return ImageElm(Homom(riker),preim^x);
128 local w,preim;
130 preim := ResultOfStraightLineProgram(w,pregensfac(riker));
131 return ImageElm(Homom(riker),preim^x);
/dports/math/gap/gap-4.11.0/pkg/ctbllib/tst/
H A Dmultfre2.tst105 > local s0fuss, poss, der, sfusfact, outerins, outerinfact, preim,
134 > preim:= Flat( InverseMap( GetFusionMap( tbl, fact ) ){ outerinfact[1] } );
135 > squares:= Set( PowerMap( tbl, 2 ){ preim } );
940 gap> preim:= InverseMap( factfus )[5];
942 gap> List( outerfus, x -> List( preim, i -> i in x ) );
H A Dprobgen.tst3641 gap> preim:= List( ccl,
3643 gap> pccl:= List( preim, x -> ConjugacyClass( n, x ) );;
/dports/textproc/sl-mythes/sl-mythes-2016.06.30/
H A Dth_sl_SI_v2.idx11708 preim�ljenost|656732