Permutations that avoid given patterns have been studied in great depth for their connections to other fields of mathematics, computer science, and biology. From a combinatorial perspective, permutation patterns have served as a unifying interpretation that relates a vast array of combinatorial structures. In this paper, we introduce the notion of patterns in inversion sequences. A sequence (e1,e2,…,en)
Nearby in the stack
is an inversion sequence if
0≤ei<i
for all
i∈[n]
. Inversion sequences of length
n
are in bijection with permutations of length
n
; an inversion sequence can be obtained from any permutation
π=π1π2…πn
by setting
ei=∣{j∣j<iandπj>πi}∣
. This correspondence makes it a natural extension to study patterns in inversion sequences much in the same way that patterns have been studied in permutations. This paper, the first of two on patterns in inversion sequences, focuses on the enumeration of inversion sequences that avoid words of length three. Our results connect patterns in inversion sequences to a number of well-known numerical sequences including Fibonacci numbers, Bell numbers, Schröder numbers, and Euler up/down numbers.
arXiv did not return neighbours for this paper. Try again in a bit.