cs.DScs.DMTheoretical
(Un)ranking Permutation Classes
Jun 11, 2026
AI Summaryllama-3.1-8b-instruct
This paper presents methods for ranking and unranking permutations avoiding a pattern of length three in lexicographic or colexicographic order.
This paper presents novel methods for ranking and unranking permutations avoiding a pattern of length three, which is a new contribution to the field.
Before reading this…
Applications
- →Combinatorial optimization
- →Algorithm design
Skill Ladder
To understand this paper, make sure you know these concepts first:
- Combinatoricsfind papers →
- Permutation theoryfind papers →
Abstract
More Like ThisPermutations 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.