Compact representations of pattern-avoiding permutations

László Kozma, Michal Opler

Pattern-avoiding permutations are a central object of study in both combinatorics and theoretical computer science. In this paper we design a data structure that can store any size…