Restricted inversion sequences and Schroder paths

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¨oder paths.