Random Sequences
Foley, James Michael Consider a set of k elements. Let the elements be the first k positive integers. Consider the permutation set that corresponds to the first k positive integers - and let each element's order equal that element's value.
At every line of the permutation set, there exists an element or there exist the elements of the greatest order so far while doing a left-to-right scan. As a consequence, six permutation set properties exist. Expectations and e...