An Algorithm for Minimal Number-Grouped Partitions of Random Permutations

Abstract:

      In this paper, by means of a kind of strongly isomorphic cutting-branch technique, an algorithm for the problem of finding the minimal number-grouped partitions of random permutations is given, and the open problem in [ 1] is solved.