Regarding longest increasing subsequences in permutations of n elements

207 Views Asked by At

I was trying to solve a problem wherein I had to find the number permutations of $n$ elements which have a longest increasing subsequence (LIS) of length $m$. Ideally, I'd want to have a function $F(n, m)$ where $n$ denotes the number of elements being permuted and $m(<n)$ denotes the length of the LIS we require, and the the function returns the number of permutations which have a LIS of length $m$.