Abstract
The number of permutations that do not contain, as a factor (subword), a given set of permutations Π is studied. A new treatment of the case Π = { 12 ⋯ k } is given and then some numerical data is presented for sets Π consisting of permutations of length at most 4. Some large sets of Wilf-equivalent permutations are also given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
