Partitioning Schemes Combinatorial Analysis (Algorithms and Standard Program Development )

<p>This diploma contains combinatorial-probabilistic analysis of the following schemes:</p><p>&nbsp; 1) scheme of partitioning set of the distinguishable elements into groups;</p><p>&nbsp; 2) scheme of partitioning set of the indistinguishable elements into groups;</p><p>within the cases of two problems:</p><p>&nbsp; 1) partitioning set into the fixed number of groups;</p><p>&nbsp; 2) partitioning set into the groups of the fixed sizes.</p><p>By groups we denote distinguishable non-empty subsets of the given set.</p><p>Combinatorial-probabilistic analysis contains the following set of research fields: explicit listing of the outcomes of schemes of partitioning of elements into the groups, overall number of outcomes, numbering of them, their probability distribution and modelling of the partitioning of the schemes researched.</p><p>The main purposes of this paper are the researches mentioned above, development of the algorithms of the computer implementation of those researches, and development of the actual programs that implement them.</p>