{"docId":1421,"paperId":1323,"url":"https:\/\/dmtcs.episciences.org\/1323","doi":"10.46298\/dmtcs.1323","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":155,"name":"Vol. 18 no. 2, Permutation Patterns 2015"}],"section":[{"sid":61,"title":"Permutation Patterns","description":[]}],"repositoryName":"arXiv","repositoryIdentifier":"1510.05434","repositoryVersion":4,"repositoryLink":"https:\/\/arxiv.org\/abs\/1510.05434v4","dateSubmitted":"2016-03-30 15:14:46","dateAccepted":null,"datePublished":"2016-03-31 11:47:19","titles":["Patterns in Inversion Sequences I"],"authors":["Corteel, Sylvie","Martinez, Megan A.","Savage, Carla D.","Weselcouch, Michael"],"abstracts":["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 $(e_1,e_2,\\ldots,e_n)$ is an inversion sequence if $0 \\leq e_i* \\pi_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\\\"oder numbers, and Euler up\/down numbers."],"keywords":["Mathematics - Combinatorics","05A05, 05A19"]}*