USING THE MONTE CARLO METHOD FOR FAST SIMULATION OF THE NUMBER OF 'GOOD' PERMUTATIONS ON THE SCIT-4 MULTIPROCESSOR COMPUTER COMPLEX

摘要

A permutation (s_0,s_1,...,s_(N-1)) of symbols 0,1,..., N-1 is called "good" if the set (t_0,t_1,...,t_(N-1)) formed by the rule t_i =i+s_i (mod N), i = 0,1,..., N -1, is also a permutation. The author proposes the fast simulation method. Its implementation on the SCIT-4 multiprocessor computer complex makes it possible to evaluate the number of "good" permutations for N ≤ 305 with relative accuracy no greater than 1%. The number of "good" permutations is estimated for N =25,35, ...,305.