'Native' conjugacy class representative calculation. Transformations are separated into single point mappings of the form [source image]. A permutation is constructed by finding the minimal relabeling of a transformation.
'Native' conjugacy class representative calculation. Transformations are separated into single point mappings of the form [source image]. A permutation is constructed by finding the minimal relabeling of a transformation.
(all-realizations sources p target)
All realizations of a desired map target
using available mappings in
sources
, compatible with the partial permutation p. Just systematically
trying to realize all mappings. It returns a vector of remaining sources -
extended permutation pairs.
All realizations of a desired map `target` using available mappings in `sources`, compatible with the partial permutation p. Just systematically trying to realize all mappings. It returns a vector of remaining sources - extended permutation pairs.
(conj-conj t)
(conj-conj [L G] t)
Conjoins a transformation to a conjugacy class representative sequence, based on the minimal conjugators of the sequence.
Conjoins a transformation to a conjugacy class representative sequence, based on the minimal conjugators of the sequence.
(conjrep2 t)
Direct construction of conjugacy class representative of transformation t.
Direct construction of conjugacy class representative of transformation t.
(conjrep_old t)
Direct construction of conjugacy class representative of transformation t.
Direct construction of conjugacy class representative of transformation t.
(conjugators t r)
All permutations that take t to r by conjugation.
All permutations that take t to r by conjugation.
(hash-map2perm m)
Turning a permuation represented as a hash-map into a vector, the canonical transformation representation.
Turning a permuation represented as a hash-map into a vector, the canonical transformation representation.
(realize-a-mapping m d p)
Given a mapping m and a desired mapping d, we try to turn the mapping m into d by extending a partial permutation p represented as a hashmap. This may fail if we already had a map to that point, or we end up mapping a single point to two images. An extended hashmap is returned if it is possible, otherwise nil.
Given a mapping m and a desired mapping d, we try to turn the mapping m into d by extending a partial permutation p represented as a hashmap. This may fail if we already had a map to that point, or we end up mapping a single point to two images. An extended hashmap is returned if it is possible, otherwise nil.
(setconjrep T)
Setwise conjugacy class representative of T. Using conjugacy/setconjrep, but only with symmetries that take produce the minimal conjrep.
Setwise conjugacy class representative of T. Using conjugacy/setconjrep, but only with symmetries that take produce the minimal conjrep.
(setconjrepfunc S G)
Returns a conjugacy representative set calculating function. This precalculates the minimal conjugators, hance the speed.
Returns a conjugacy representative set calculating function. This precalculates the minimal conjugators, hance the speed.
cljdoc builds & hosts documentation for Clojure/Script libraries
Ctrl+k | Jump to recent docs |
← | Move to previous article |
→ | Move to next article |
Ctrl+/ | Jump to the search field |