Abstract

This paper deals with the determination of subsets of permutations, which satisfy certain conditions. Two new methods are proposed; one for the permutations, that correspond to a given pattern, and one for the triple τ = ( A, M, cM) as it has been introduced by Viennot [5]. Both these two methods, can easily be applied on a computer.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call