kigen.morphism — kigen 19.08.05

Constructing morphisms and morphic relations. input: two multiplication tables (source, target) output: vectors describing morphisms, index i -> image

These functions are relatively inefficient (compared to generator table methods). More for reference purposes, not for the high-end computations.

This is a reference implementation for the paper: Finite Computational Structures and Implementations: Semigroups and Morphic Relations International Journal of Networking and Computing, Volume 7, Number 2, pages 318–335, July 2017

divisions clj

(divisions S T)

All divisions from S to T.

homomorphic? clj

(homomorphic? S T hom)

Decides whether the partial mapping hom from S to T is homomorphic or not. It lazily checks all products.

homomorphisms clj

(homomorphisms S T)

All homomorphisms from S to T.

isomorphisms clj

(isomorphisms S T)

All isomorphisms from S to T.

relmorphic? clj

(relmorphic? S T hom)

Decides whether the (partial) mapping hom from S to T with given domain and codomain is a relational morphism or not.

relmorphisms clj

(relmorphisms S T)

All relational morphisms from S to T. These are one-to-many set-valued morphic mappings.

total? clj

(total? S hom)

Returns true if the given morphism is total, false if it is partial.