Authors

Homomorphism groups computing and homomorphic stability of pairs of finite groups verification

We consider all pairs of groups G and H under the condition that their orders are not greater than 12. For Abelian group H, we obtain (up to isomorphism) via computer modeling, first, the group of homomorphisms of G to H and, second, the subgroup in H which is a union of the images of all homomorphisms. For non-Abelian H, we consider the similar constrictions, but this case is more difficult.

Programming method for computing topologies and study their properties