Abstract
In this paper, we find an explicit formula for the number of inversion sequences of length n that avoid each of the pattern sets {021, 010}, {021, 011}, {021, 100, 101}, {021, 000, 101}, and {101, 102, 201}. This is done using either generating trees and generating functions, or combinatorial bijections to restricted Schröder paths.
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
