(Un)ranking Permutation Classes
Nathanaël Hassler, Vincent Vajnovszki · Electronic Proceedings in Theoretical Computer Science · 2026
Permutations avoiding a pattern of length three are enumerated by the Catalan numbers. In this work, we present methods for ranking and unranking such permutations in lexicographic or colexicographic order.