I. Grebennik, O. Lytvynenko

Full text PDF

Abstract. General approach for solving the problem of random generation of compositional k  images of combinatorial sets (k-sets) has been proposed. K-sets are powerful apparatus that can be applied for solving many scientific and applied problems. Though many literature is dedicated to the problem of generating combinatorial configurations, existing studies deals mostly with simple combinatorial configurations like combinations, permutations etc. The algorithms of generation both basic combinatorial sets and k-sets have been described. Algorithm for random generation of basic sets allows generating various combinatorial sets, and laws of constructing basic combinatorial sets can be pre-set. If identification of the laws fails, the algorithm allows using other algorithms to generate basic sets. Complexity of described algorithms has been evaluated. The complexity of the algorithm of generation k-sets is determined by the complexity of generation of basic sets, as well as the complexity of operations of nsubstitution and a number of levels of a certain k-set. The described approach to the random generation is very flexible since it allows obtaining various results by varying algorithm parameters. In its turn, it allows adjusting the number of elements for both basic sets and k-sets. The developed software allows solving the described problems of random generation of k -sets and basic combinatorial sets.

Key words: combinatorial generation, k-set, basic combinatorial set, random generation, complexity.

RANDOM GENERATION OF COMBINATORIAL SETS WITH SPECIAL PROPERTIES

ECONTECHMOD
an international quarterly journal on economics of technology and modelling processes