Algorithm of Consecutive Definition of Ranking of the Objects Nearest to the set Cyclic Relation between Objects

The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expert between objects is considered. Formalization of the problem arising at it is resulted. The algorithm based on a method of the consecutive analysis of variants and the analysis of conditions of acyclicity is offered.

Algorithms for Generating Near-Rings on Finite Cyclic Groups

In the present work are described the algorithms that generate all near-rings on finite cyclic groups of order 16 to 29.