2 research outputs found

    Restricted permutations

    No full text
    In this thesis we study different methods of counting a large number of combinatorial objects: permutations, variations, combinations, subsets, with some additional restrictions. We have developed a completely new method for the enumeration of some of these objects and make connections among some of them. We estimate the algorithmic complexity of the new method and analyze what is better than existing ones. We have entered a hundred new sequences in Slone’s Online encyclopedia of integer sequences and provided comments on the large number of existing sequences
    corecore