Pattern avoidance in inversion sequences
Pattern avoidance in inversion sequences
Abstract A permutation of length n may be represented, equivalently, by a sequence a 1 a 2 • • • a n satisfying 0 < a i < i for all z, which is called an inversion sequence. In analogy to the usual case for permutations, the pattern avoidance question …