The Distribution of the Length of the Longest Increasing Subsequence in Random Permutations of Arbitrary Multi-sets
The distribution of the length of the longest increasing subsequence in random permutations of arbitrary multi-sets is obtained using the finite Markov chain imbedding technique (FMCI). A numerical examples are provided to aid in understanding
Publishing Year
202