This paper introduces some isomorphism-invariants for groups and uses
them to test two finitely presented groups. The introduced algorithm starts with
the construction of all cyclic groups contained in the groups under test, then it
compares the d
istribution of a particular set of elements in the constructed
cyclic groups. The algorithm leads to one of these two results:
1. The groups have the same "fingerprint"
2. The groups are not isomorphic
The paper aims to distinguish the couple-couple non-isomorphism
hypergraphs, which have a known vertexes number, Z, and sides number, d.
To solve this problem a number of criteria graded in distinguishing
accuracy are developed.
It also presents
an experimental method to test the efficiency of the used
criteria. It gives a method to put them in order.
This research is considered a practical because it is useful in designing of
machines and variable structure complex systems, and in comparing the new
patterns.
The objective of this studying is the important answer on the following open question : Let G and G' be two fuzzy groups and L(G), L(G') be lattices for them, respectively,
We have shown that this statement don’t true in the case general, and we sup
pose some certain conditions on the purposed groups to be the statement holds. Moreover, some important theorems are proved
