Gezer, Melis2024-06-132024-06-132024-052024-052024-06-12https://hdl.handle.net/11693/115199Cataloged from PDF version of article.Thesis (Master's): Bilkent University, Department of Mathematics, İhsan Doğramacı Bilkent University, 2024.Includes bibliographical references (leave 97-99).An inversion sequence of length n is an integer sequence e = e1 · · · en such that 0 ≤ ei < i for each 0 ≤ i ≤ n. We use In to denote the set of inversion sequences of length n. Let [k] := {0, 1, · · · , k − 1} denote the alphabet and τ be a word of length k over this alphabet. A pattern of length k is simply a word over the alphabet [k]. We say an inversion sequence e ∈ In contains the pattern τ of length k if it contains a sub-sequence of length k that is order isomorphic to τ; otherwise, e avoids the pattern τ . For a given pattern τ , we use In(τ ) to denote the set of all τ -avoiding inversion sequences of length n. Firstly, we review the enumeration of inversion sequences that avoid patterns of length three. We then study an enumeration method based on generating trees and the kernel method to enumerate pattern-avoiding inversion sequences for general patterns. Then, we provide sampling algorithms for pattern-avoiding inversion sequences and apply them to some specific patterns. Based on extensive simulations, we study some statistics such as the number of zeros, the number of distinct elements, the number of repeated elements, and the maximum elements. Finally, we present a bijection between In(0312) and In(0321) that preserves these statistics.x, 99 leaves : charts ; 30 cm.Englishinfo:eu-repo/semantics/openAccessInversion sequencesPattern avoidanceGenerating functionsGenerating treesKernel methodRandom samplingThesisB124742