Transformations and permutations simply representated as vectors.
Transformations and permutations simply representated as vectors.
(act points t)Transformation t acting on a set of points.
Transformation t acting on a set of points.
(conjugate t p)The conjugate of a transformation by direct relabeling according to p.
The conjugate of a transformation by direct relabeling according to p.
(conjugate-by-definition t p)The conjugate of a transformation by a permutation according to the definition, i.e. multiplying by inverse on the left and p on the right.
The conjugate of a transformation by a permutation according to the definition, i.e. multiplying by inverse on the left and p on the right.
(full-ts-gens n)Generators of the full transformation semigroup of degree n.
Generators of the full transformation semigroup of degree n.
(inverse t)Inverse of a bijective transformation.
Inverse of a bijective transformation.
(mul s t)Right multiplication of transformations represented by vectors.
Right multiplication of transformations represented by vectors.
(pre-images t)Returns the point to set of pre-images map. It works both for vector and hash-map representations.
Returns the point to set of pre-images map. It works both for vector and hash-map representations.
(pts-gens n)Generators of the partial transformation semigroup of degree n.
Generators of the partial transformation semigroup of degree n.
(single-maps t)All mappings of a transformation in the form of [src img] extracted
from a transformation t. Similar to seq of a hash-map.
The order is kept.
It works both for vector and hash-map representations.
All mappings of a transformation in the form of [src img] extracted from a transformation t. Similar to `seq` of a hash-map. The order is kept. It works both for vector and hash-map representations.
(sym-inv-gens n)Generators of the symmetric inverse monoid of degree n.
Generators of the symmetric inverse monoid of degree n.
(symmetric-gens n)Generators of the symmetric group of degree n using the embedding into the partitioned binary relation monoid defined by f.
Generators of the symmetric group of degree n using the embedding into the partitioned binary relation monoid defined by f.
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 |